./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:47:03,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:47:03,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:47:03,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:47:03,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:47:03,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:47:03,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:47:03,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:47:03,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:47:03,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:47:03,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:47:03,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:47:03,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:47:03,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:47:03,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:47:03,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:47:03,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:47:03,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:47:03,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:47:03,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:47:03,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:47:03,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:47:03,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:47:03,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:47:03,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:47:03,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:47:03,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:47:03,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:47:03,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:47:03,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:47:03,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:47:03,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:47:03,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:47:03,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:47:03,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:47:03,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:47:03,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:47:03,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:47:03,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:47:03,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:47:03,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:47:03,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:47:03,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 [2024-11-08 23:47:04,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:47:04,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:47:04,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:47:04,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:47:04,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:47:04,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i [2024-11-08 23:47:05,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:47:05,629 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:47:05,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i [2024-11-08 23:47:05,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a2089cc/86701ed5ccdd4feda6c9ea486c2e2072/FLAG016590100 [2024-11-08 23:47:05,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1a2089cc/86701ed5ccdd4feda6c9ea486c2e2072 [2024-11-08 23:47:05,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:47:05,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:47:05,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:47:05,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:47:05,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:47:05,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605dd69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05, skipping insertion in model container [2024-11-08 23:47:05,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:47:05,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i[914,927] [2024-11-08 23:47:05,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:47:05,877 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:47:05,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i[914,927] [2024-11-08 23:47:05,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:47:05,926 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:47:05,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05 WrapperNode [2024-11-08 23:47:05,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:47:05,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:47:05,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:47:05,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:47:05,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,966 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-08 23:47:05,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:47:05,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:47:05,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:47:05,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:47:05,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:05,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:47:06,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:47:06,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:47:06,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:47:06,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:47:06,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (1/1) ... [2024-11-08 23:47:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:47:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:47:06,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:47:06,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:47:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:47:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:47:06,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:47:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:47:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:47:06,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:47:06,185 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:47:06,191 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:47:06,450 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 23:47:06,451 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:47:06,462 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:47:06,463 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:47:06,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:47:06 BoogieIcfgContainer [2024-11-08 23:47:06,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:47:06,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:47:06,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:47:06,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:47:06,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:47:05" (1/3) ... [2024-11-08 23:47:06,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a25c169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:47:06, skipping insertion in model container [2024-11-08 23:47:06,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:05" (2/3) ... [2024-11-08 23:47:06,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a25c169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:47:06, skipping insertion in model container [2024-11-08 23:47:06,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:47:06" (3/3) ... [2024-11-08 23:47:06,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-9.i [2024-11-08 23:47:06,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:47:06,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:47:06,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:47:06,560 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a51cc26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:47:06,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:47:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 23:47:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:47:06,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:06,573 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:06,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:06,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash 918996230, now seen corresponding path program 1 times [2024-11-08 23:47:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:47:06,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060405077] [2024-11-08 23:47:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:47:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:47:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:47:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:47:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:47:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:47:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:47:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060405077] [2024-11-08 23:47:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060405077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:06,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:47:06,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406377948] [2024-11-08 23:47:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:06,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:47:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:47:06,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:47:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:47:06,835 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 23:47:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:06,849 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2024-11-08 23:47:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:47:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-11-08 23:47:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:06,856 INFO L225 Difference]: With dead ends: 81 [2024-11-08 23:47:06,856 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 23:47:06,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:47:06,861 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:06,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:47:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 23:47:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 23:47:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 23:47:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-08 23:47:06,888 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 45 [2024-11-08 23:47:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:06,888 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-08 23:47:06,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 23:47:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-08 23:47:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:47:06,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:06,890 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:06,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:47:06,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:06,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:06,891 INFO L85 PathProgramCache]: Analyzing trace with hash 938264772, now seen corresponding path program 1 times [2024-11-08 23:47:06,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:47:06,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089568186] [2024-11-08 23:47:06,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:06,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:47:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:47:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:47:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:47:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:47:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:47:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:47:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089568186] [2024-11-08 23:47:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089568186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:07,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:07,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:47:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377714440] [2024-11-08 23:47:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:07,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:47:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:47:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:47:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:47:07,086 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:07,167 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2024-11-08 23:47:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:47:07,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2024-11-08 23:47:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:07,168 INFO L225 Difference]: With dead ends: 123 [2024-11-08 23:47:07,170 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 23:47:07,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:47:07,171 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 68 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:07,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 146 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:47:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 23:47:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2024-11-08 23:47:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:47:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2024-11-08 23:47:07,192 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 45 [2024-11-08 23:47:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:07,193 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2024-11-08 23:47:07,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2024-11-08 23:47:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 23:47:07,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:07,194 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:47:07,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:07,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1274769601, now seen corresponding path program 1 times [2024-11-08 23:47:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:47:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028993696] [2024-11-08 23:47:07,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:47:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:47:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:47:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:47:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:47:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:47:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:47:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028993696] [2024-11-08 23:47:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028993696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:47:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951915935] [2024-11-08 23:47:07,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:07,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:47:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:47:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:47:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:47:07,357 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:07,384 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2024-11-08 23:47:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:47:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-08 23:47:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:07,386 INFO L225 Difference]: With dead ends: 157 [2024-11-08 23:47:07,386 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 23:47:07,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:47:07,387 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:07,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 90 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:47:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 23:47:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2024-11-08 23:47:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:47:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-11-08 23:47:07,398 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 46 [2024-11-08 23:47:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:07,398 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-11-08 23:47:07,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-11-08 23:47:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 23:47:07,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:07,399 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:47:07,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:07,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1298749694, now seen corresponding path program 1 times [2024-11-08 23:47:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:47:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789315351] [2024-11-08 23:47:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:47:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:47:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:47:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:47:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:47:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:47:08,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:47:08,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789315351] [2024-11-08 23:47:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789315351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:47:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23480650] [2024-11-08 23:47:08,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:47:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:47:08,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:47:08,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:47:08,013 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:08,154 INFO L93 Difference]: Finished difference Result 141 states and 181 transitions. [2024-11-08 23:47:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:47:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2024-11-08 23:47:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:08,155 INFO L225 Difference]: With dead ends: 141 [2024-11-08 23:47:08,155 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 23:47:08,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:47:08,156 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:08,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:47:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 23:47:08,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-08 23:47:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:47:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2024-11-08 23:47:08,176 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 47 [2024-11-08 23:47:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:08,177 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2024-11-08 23:47:08,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2024-11-08 23:47:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 23:47:08,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:08,181 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:08,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:47:08,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:08,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:08,182 INFO L85 PathProgramCache]: Analyzing trace with hash -95031816, now seen corresponding path program 1 times [2024-11-08 23:47:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:47:08,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368336060] [2024-11-08 23:47:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:08,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:47:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:47:08,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974723047] [2024-11-08 23:47:08,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:08,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:47:08,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:47:08,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:47:08,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:47:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:47:08,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:47:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:47:08,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:47:08,343 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:47:08,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:47:08,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:47:08,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:47:08,549 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:47:08,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:47:08,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:47:08 BoogieIcfgContainer [2024-11-08 23:47:08,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:47:08,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:47:08,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:47:08,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:47:08,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:47:06" (3/4) ... [2024-11-08 23:47:08,596 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:47:08,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:47:08,600 INFO L158 Benchmark]: Toolchain (without parser) took 2939.18ms. Allocated memory is still 182.5MB. Free memory was 114.3MB in the beginning and 110.6MB in the end (delta: 3.7MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-08 23:47:08,600 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:47:08,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.49ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 100.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:47:08,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.02ms. Allocated memory is still 182.5MB. Free memory was 100.3MB in the beginning and 97.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:47:08,603 INFO L158 Benchmark]: Boogie Preprocessor took 52.93ms. Allocated memory is still 182.5MB. Free memory was 97.8MB in the beginning and 94.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:47:08,604 INFO L158 Benchmark]: RCFGBuilder took 442.74ms. Allocated memory is still 182.5MB. Free memory was 94.7MB in the beginning and 142.6MB in the end (delta: -47.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:47:08,604 INFO L158 Benchmark]: TraceAbstraction took 2126.86ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 110.6MB in the end (delta: 31.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2024-11-08 23:47:08,604 INFO L158 Benchmark]: Witness Printer took 7.02ms. Allocated memory is still 182.5MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:47:08,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.49ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 100.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.02ms. Allocated memory is still 182.5MB. Free memory was 100.3MB in the beginning and 97.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.93ms. Allocated memory is still 182.5MB. Free memory was 97.8MB in the beginning and 94.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 442.74ms. Allocated memory is still 182.5MB. Free memory was 94.7MB in the beginning and 142.6MB in the end (delta: -47.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2126.86ms. Allocated memory is still 182.5MB. Free memory was 141.9MB in the beginning and 110.6MB in the end (delta: 31.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 7.02ms. Allocated memory is still 182.5MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of shiftLeft at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed short int last_1_var_1_8 = 100; [L31] double last_1_var_1_10 = 9.2; VAL [isInitial=0, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L71] last_1_var_1_8 = var_1_8 [L72] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L62] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L63] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L63] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L64] var_1_7 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_8=100, var_1_9=32] [L65] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_8=100, var_1_9=32] [L66] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L67] var_1_11 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L68] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L84] RET updateVariables() [L85] CALL step() [L35] COND FALSE !(last_1_var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L38] COND FALSE !(((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) [L45] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=64] [L50] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=100, var_1_9=64] [L50] COND TRUE (10 << var_1_9) < (var_1_3 * var_1_1) [L51] var_1_8 = (var_1_9 + var_1_1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L53] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L54] COND TRUE ((var_1_1 + var_1_9) < 10) || stepLocal_0 [L55] var_1_12 = ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L85] RET step() [L86] CALL, EXPR property() [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L75] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L75-L76] return (((((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((var_1_1 + var_1_9) < 10) || (var_1_10 > var_1_10)) ? (var_1_12 == ((signed short int) ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))))) : (var_1_12 == ((signed short int) var_1_8))) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=318, var_1_1=254, var_1_3=254, var_1_7=0, var_1_8=318, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 405 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 219 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 160/160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:47:08,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:47:10,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:47:10,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:47:10,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:47:10,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:47:10,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:47:10,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:47:10,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:47:10,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:47:10,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:47:10,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:47:10,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:47:10,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:47:10,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:47:10,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:47:10,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:47:10,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:47:10,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:47:10,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:47:10,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:47:10,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:47:10,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:47:10,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:47:10,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:47:10,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:47:10,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:47:10,916 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:47:10,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:47:10,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:47:10,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:47:10,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:47:10,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:47:10,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:47:10,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:47:10,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:47:10,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:47:10,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:47:10,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:47:10,919 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:47:10,919 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:47:10,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:47:10,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:47:10,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:47:10,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:47:10,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed9d861075c8c518defc00306ada282c1d9fd40ebe62b1212ecfccba3a9578d4 [2024-11-08 23:47:11,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:47:11,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:47:11,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:47:11,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:47:11,254 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:47:11,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i [2024-11-08 23:47:12,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:47:12,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:47:12,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i [2024-11-08 23:47:12,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b81b0a3/6285825f85bf42dbb148a16579e3ff4d/FLAGfda21d3b1 [2024-11-08 23:47:12,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b81b0a3/6285825f85bf42dbb148a16579e3ff4d [2024-11-08 23:47:12,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:47:12,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:47:12,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:47:12,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:47:12,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:47:12,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:47:12" (1/1) ... [2024-11-08 23:47:12,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d8d0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:12, skipping insertion in model container [2024-11-08 23:47:12,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:47:12" (1/1) ... [2024-11-08 23:47:12,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:47:13,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i[914,927] [2024-11-08 23:47:13,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:47:13,135 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:47:13,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-9.i[914,927] [2024-11-08 23:47:13,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:47:13,181 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:47:13,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13 WrapperNode [2024-11-08 23:47:13,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:47:13,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:47:13,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:47:13,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:47:13,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,220 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-11-08 23:47:13,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:47:13,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:47:13,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:47:13,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:47:13,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,254 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:47:13,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:47:13,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:47:13,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:47:13,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:47:13,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (1/1) ... [2024-11-08 23:47:13,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:47:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:47:13,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:47:13,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:47:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:47:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:47:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:47:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:47:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:47:13,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:47:13,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:47:13,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:47:13,627 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 23:47:13,627 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:47:13,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:47:13,639 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:47:13,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:47:13 BoogieIcfgContainer [2024-11-08 23:47:13,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:47:13,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:47:13,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:47:13,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:47:13,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:47:12" (1/3) ... [2024-11-08 23:47:13,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46176a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:47:13, skipping insertion in model container [2024-11-08 23:47:13,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:47:13" (2/3) ... [2024-11-08 23:47:13,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46176a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:47:13, skipping insertion in model container [2024-11-08 23:47:13,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:47:13" (3/3) ... [2024-11-08 23:47:13,648 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-9.i [2024-11-08 23:47:13,661 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:47:13,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:47:13,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:47:13,714 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24d65f01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:47:13,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:47:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 23:47:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:47:13,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:13,727 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:13,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:13,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 36096306, now seen corresponding path program 1 times [2024-11-08 23:47:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:47:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134025472] [2024-11-08 23:47:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:13,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:13,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:47:13,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:47:13,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:47:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:13,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:47:13,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:47:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 23:47:13,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:47:13,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:47:13,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134025472] [2024-11-08 23:47:13,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134025472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:13,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:13,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:47:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957945720] [2024-11-08 23:47:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:13,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:47:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:47:13,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:47:13,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:47:13,923 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 23:47:13,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:13,941 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2024-11-08 23:47:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:47:13,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-08 23:47:13,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:13,949 INFO L225 Difference]: With dead ends: 66 [2024-11-08 23:47:13,949 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 23:47:13,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:47:13,956 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:13,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:47:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 23:47:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 23:47:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 23:47:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-08 23:47:13,989 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 42 [2024-11-08 23:47:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:13,990 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-08 23:47:13,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 23:47:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-08 23:47:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:47:13,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:13,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:13,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:47:14,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:14,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927092, now seen corresponding path program 1 times [2024-11-08 23:47:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:47:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578289024] [2024-11-08 23:47:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:14,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:47:14,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:47:14,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:47:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:14,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:47:14,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:47:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:47:14,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:47:14,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:47:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578289024] [2024-11-08 23:47:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578289024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:47:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933576492] [2024-11-08 23:47:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:47:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:47:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:47:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:47:14,410 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:14,497 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2024-11-08 23:47:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:47:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2024-11-08 23:47:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:14,499 INFO L225 Difference]: With dead ends: 94 [2024-11-08 23:47:14,499 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 23:47:14,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:47:14,500 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:14,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 102 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:47:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 23:47:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2024-11-08 23:47:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:47:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-11-08 23:47:14,512 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 42 [2024-11-08 23:47:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-11-08 23:47:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-11-08 23:47:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:47:14,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:14,516 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:14,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:47:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:14,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1613239035, now seen corresponding path program 1 times [2024-11-08 23:47:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:47:14,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410607994] [2024-11-08 23:47:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:14,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:47:14,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:47:14,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:47:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:14,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:47:14,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:47:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 23:47:14,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:47:14,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:47:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410607994] [2024-11-08 23:47:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410607994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:14,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:47:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319034132] [2024-11-08 23:47:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:14,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:47:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:47:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:47:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:47:14,895 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:14,964 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2024-11-08 23:47:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:47:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-11-08 23:47:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:14,966 INFO L225 Difference]: With dead ends: 124 [2024-11-08 23:47:14,966 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 23:47:14,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:47:14,968 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:14,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:47:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 23:47:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2024-11-08 23:47:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:47:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2024-11-08 23:47:14,978 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 43 [2024-11-08 23:47:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2024-11-08 23:47:14,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-11-08 23:47:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:47:14,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:14,979 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:14,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 23:47:15,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:15,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1611391993, now seen corresponding path program 1 times [2024-11-08 23:47:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:47:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941847556] [2024-11-08 23:47:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:15,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:47:15,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:47:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:47:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:15,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:47:15,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:47:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 23:47:20,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:47:20,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:47:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941847556] [2024-11-08 23:47:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941847556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:47:20,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855891620] [2024-11-08 23:47:20,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:47:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:47:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:47:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:47:20,012 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:20,612 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-08 23:47:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:47:20,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-11-08 23:47:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:20,614 INFO L225 Difference]: With dead ends: 80 [2024-11-08 23:47:20,614 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 23:47:20,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-08 23:47:20,615 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:20,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 108 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:47:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 23:47:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2024-11-08 23:47:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 23:47:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-11-08 23:47:20,627 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 43 [2024-11-08 23:47:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:20,628 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-11-08 23:47:20,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-11-08 23:47:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:47:20,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:47:20,629 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:47:20,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 23:47:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:20,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:47:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:47:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash 163615369, now seen corresponding path program 1 times [2024-11-08 23:47:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:47:20,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824180542] [2024-11-08 23:47:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:47:20,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:20,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:47:20,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:47:20,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 23:47:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:47:20,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 23:47:20,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:47:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 23:47:22,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:47:22,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:47:22,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824180542] [2024-11-08 23:47:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824180542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:47:22,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:47:22,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 23:47:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891193619] [2024-11-08 23:47:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:47:22,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:47:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:47:22,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:47:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:47:22,963 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:47:23,561 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-11-08 23:47:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:47:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-11-08 23:47:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:47:23,562 INFO L225 Difference]: With dead ends: 78 [2024-11-08 23:47:23,563 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:47:23,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-08 23:47:23,564 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:47:23,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:47:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:47:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:47:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 23:47:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:47:23,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2024-11-08 23:47:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:47:23,565 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:47:23,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 23:47:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:47:23,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:47:23,568 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:47:23,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 23:47:23,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:47:23,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:47:23,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:47:24,624 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:47:24,638 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,638 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,639 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,639 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-08 23:47:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,640 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,641 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-08 23:47:24,641 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,647 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-08 23:47:24,648 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,648 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-08 23:47:24,648 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,648 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-08 23:47:24,648 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,649 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-08 23:47:24,649 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-08 23:47:24,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:47:24 BoogieIcfgContainer [2024-11-08 23:47:24,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:47:24,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:47:24,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:47:24,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:47:24,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:47:13" (3/4) ... [2024-11-08 23:47:24,656 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:47:24,659 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:47:24,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 23:47:24,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 23:47:24,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:47:24,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:47:24,742 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:47:24,743 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:47:24,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:47:24,743 INFO L158 Benchmark]: Toolchain (without parser) took 11861.13ms. Allocated memory was 94.4MB in the beginning and 914.4MB in the end (delta: 820.0MB). Free memory was 56.7MB in the beginning and 538.2MB in the end (delta: -481.5MB). Peak memory consumption was 339.0MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,743 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 94.4MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:47:24,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.57ms. Allocated memory is still 94.4MB. Free memory was 56.4MB in the beginning and 70.3MB in the end (delta: -13.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.12ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,744 INFO L158 Benchmark]: Boogie Preprocessor took 55.73ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 65.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,744 INFO L158 Benchmark]: RCFGBuilder took 362.45ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 51.8MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,745 INFO L158 Benchmark]: TraceAbstraction took 11011.15ms. Allocated memory was 94.4MB in the beginning and 914.4MB in the end (delta: 820.0MB). Free memory was 51.4MB in the beginning and 544.5MB in the end (delta: -493.1MB). Peak memory consumption was 325.1MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,745 INFO L158 Benchmark]: Witness Printer took 89.85ms. Allocated memory is still 914.4MB. Free memory was 544.5MB in the beginning and 538.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:47:24,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 94.4MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.57ms. Allocated memory is still 94.4MB. Free memory was 56.4MB in the beginning and 70.3MB in the end (delta: -13.9MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.12ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.73ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 65.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.45ms. Allocated memory is still 94.4MB. Free memory was 65.7MB in the beginning and 51.8MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11011.15ms. Allocated memory was 94.4MB in the beginning and 914.4MB in the end (delta: 820.0MB). Free memory was 51.4MB in the beginning and 544.5MB in the end (delta: -493.1MB). Peak memory consumption was 325.1MB. Max. memory is 16.1GB. * Witness Printer took 89.85ms. Allocated memory is still 914.4MB. Free memory was 544.5MB in the beginning and 538.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 308 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 183 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 21 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 200/200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (((var_1_10 == var_1_11) && (var_1_1 == var_1_3)) && (var_1_9 == 64))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (var_1_9 == 64)) Ensures: (((0 != cond) && (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (var_1_9 == 64))) && (((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (last_1_var_1_8 == \old(last_1_var_1_8))) && (last_1_var_1_10 == \old(last_1_var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:47:24,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE