./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:48:41,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:48:41,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:48:41,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:48:41,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:48:42,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:48:42,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:48:42,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:48:42,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:48:42,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:48:42,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:48:42,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:48:42,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:48:42,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:48:42,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:48:42,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:48:42,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:48:42,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:48:42,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:48:42,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:48:42,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:48:42,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:48:42,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:48:42,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:48:42,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:48:42,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:48:42,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:48:42,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:48:42,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:48:42,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:48:42,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:48:42,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:48:42,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:48:42,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:48:42,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:48:42,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:48:42,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:48:42,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:48:42,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:48:42,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:48:42,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:48:42,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:48:42,040 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-clean/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-clean/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 -> 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d [2024-10-11 11:48:42,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:48:42,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:48:42,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:48:42,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:48:42,323 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:48:42,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i [2024-10-11 11:48:43,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:48:43,999 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:48:44,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i [2024-10-11 11:48:44,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7f1392829/33f359b675f7415989c3062bdb588719/FLAG214717d97 [2024-10-11 11:48:44,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7f1392829/33f359b675f7415989c3062bdb588719 [2024-10-11 11:48:44,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:48:44,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:48:44,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:48:44,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:48:44,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:48:44,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6de5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44, skipping insertion in model container [2024-10-11 11:48:44,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:48:44,238 WARN L248 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_50-1loop_file-40.i[915,928] [2024-10-11 11:48:44,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:48:44,325 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:48:44,338 WARN L248 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_50-1loop_file-40.i[915,928] [2024-10-11 11:48:44,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:48:44,401 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:48:44,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44 WrapperNode [2024-10-11 11:48:44,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:48:44,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:48:44,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:48:44,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:48:44,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,484 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-11 11:48:44,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:48:44,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:48:44,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:48:44,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:48:44,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,534 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-10-11 11:48:44,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:48:44,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:48:44,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:48:44,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:48:44,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (1/1) ... [2024-10-11 11:48:44,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:48:44,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:48:44,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:48:44,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:48:44,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:48:44,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:48:44,661 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:48:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:48:44,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:48:44,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:48:44,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:48:44,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:48:45,154 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 11:48:45,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:48:45,190 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:48:45,190 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:48:45,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:45 BoogieIcfgContainer [2024-10-11 11:48:45,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:48:45,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:48:45,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:48:45,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:48:45,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:48:44" (1/3) ... [2024-10-11 11:48:45,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af79f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:48:45, skipping insertion in model container [2024-10-11 11:48:45,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:44" (2/3) ... [2024-10-11 11:48:45,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af79f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:48:45, skipping insertion in model container [2024-10-11 11:48:45,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:45" (3/3) ... [2024-10-11 11:48:45,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-40.i [2024-10-11 11:48:45,221 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:48:45,222 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:48:45,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:48:45,297 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;@748621eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:48:45,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:48:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 11:48:45,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:45,314 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:45,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:45,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash 216116180, now seen corresponding path program 1 times [2024-10-11 11:48:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443137160] [2024-10-11 11:48:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:45,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443137160] [2024-10-11 11:48:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443137160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:45,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:45,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:48:45,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552053333] [2024-10-11 11:48:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:45,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:48:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:48:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:48:45,741 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:48:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:45,806 INFO L93 Difference]: Finished difference Result 87 states and 145 transitions. [2024-10-11 11:48:45,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:48:45,808 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-10-11 11:48:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:45,815 INFO L225 Difference]: With dead ends: 87 [2024-10-11 11:48:45,815 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 11:48:45,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-10-11 11:48:45,823 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:45,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:48:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 11:48:45,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 11:48:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-11 11:48:45,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 81 [2024-10-11 11:48:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:45,868 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-11 11:48:45,868 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:48:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-11 11:48:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:48:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:45,872 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:45,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:48:45,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1010997658, now seen corresponding path program 1 times [2024-10-11 11:48:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:45,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737228755] [2024-10-11 11:48:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:46,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737228755] [2024-10-11 11:48:46,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737228755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:46,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:46,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:48:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068381777] [2024-10-11 11:48:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:46,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:48:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:46,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:48:46,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:48:46,200 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:46,228 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2024-10-11 11:48:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:48:46,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-11 11:48:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:46,232 INFO L225 Difference]: With dead ends: 83 [2024-10-11 11:48:46,232 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 11:48:46,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-10-11 11:48:46,234 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:46,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:48:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 11:48:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 11:48:46,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-10-11 11:48:46,241 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 82 [2024-10-11 11:48:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:46,243 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-10-11 11:48:46,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2024-10-11 11:48:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:48:46,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:46,245 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:46,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:48:46,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:46,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1508962276, now seen corresponding path program 1 times [2024-10-11 11:48:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:46,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681450428] [2024-10-11 11:48:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:48:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:48:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 11:48:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:48:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:48:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:48:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 11:48:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:48:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:48:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:48:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:48:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:48:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:48:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681450428] [2024-10-11 11:48:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681450428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:46,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:48:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479555137] [2024-10-11 11:48:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:48:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:48:46,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:48:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:48:46,938 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:47,409 INFO L93 Difference]: Finished difference Result 158 states and 223 transitions. [2024-10-11 11:48:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:48:47,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-11 11:48:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:47,411 INFO L225 Difference]: With dead ends: 158 [2024-10-11 11:48:47,411 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 11:48:47,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:48:47,413 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 123 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:47,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 173 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:48:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 11:48:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 73. [2024-10-11 11:48:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 50 states have internal predecessors, (62), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:48:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2024-10-11 11:48:47,468 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 82 [2024-10-11 11:48:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:47,469 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2024-10-11 11:48:47,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2024-10-11 11:48:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:48:47,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:47,472 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:47,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:48:47,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:47,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1508902694, now seen corresponding path program 1 times [2024-10-11 11:48:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:48:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156325083] [2024-10-11 11:48:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:48:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:48:47,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945940869] [2024-10-11 11:48:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:47,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:48:47,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:48:47,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:48:47,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:48:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:48:47,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:48:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:48:47,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:48:47,796 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:48:47,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:48:47,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:48:48,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:48:48,003 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 11:48:48,073 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:48:48,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:48:48 BoogieIcfgContainer [2024-10-11 11:48:48,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:48:48,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:48:48,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:48:48,077 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:48:48,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:45" (3/4) ... [2024-10-11 11:48:48,079 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:48:48,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:48:48,083 INFO L158 Benchmark]: Toolchain (without parser) took 4053.05ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 108.3MB in the beginning and 168.9MB in the end (delta: -60.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-11 11:48:48,083 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:48:48,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.35ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 92.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:48:48,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.98ms. Allocated memory is still 163.6MB. Free memory was 92.6MB in the beginning and 88.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:48:48,085 INFO L158 Benchmark]: Boogie Preprocessor took 86.09ms. Allocated memory is still 163.6MB. Free memory was 88.9MB in the beginning and 81.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:48:48,085 INFO L158 Benchmark]: RCFGBuilder took 621.33ms. Allocated memory is still 163.6MB. Free memory was 81.6MB in the beginning and 124.2MB in the end (delta: -42.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-11 11:48:48,085 INFO L158 Benchmark]: TraceAbstraction took 2880.55ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 124.2MB in the beginning and 168.9MB in the end (delta: -44.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2024-10-11 11:48:48,086 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 234.9MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:48:48,087 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.18ms. Allocated memory is still 163.6MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.35ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 92.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.98ms. Allocated memory is still 163.6MB. Free memory was 92.6MB in the beginning and 88.9MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.09ms. Allocated memory is still 163.6MB. Free memory was 88.9MB in the beginning and 81.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 621.33ms. Allocated memory is still 163.6MB. Free memory was 81.6MB in the beginning and 124.2MB in the end (delta: -42.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2880.55ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 124.2MB in the beginning and 168.9MB in the end (delta: -44.7MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 234.9MB. Free memory is still 168.9MB. 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 someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] unsigned char last_1_var_1_9 = 1; [L38] float last_1_var_1_24 = 128.5; [L110] isInitial = 1 [L111] FCALL initially() [L112] int k_loop; [L113] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1] [L113] COND TRUE k_loop < 1 [L114] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 [L103] last_1_var_1_24 = var_1_24 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L82] var_1_4 = __VERIFIER_nondet_short() [L83] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L84] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L85] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L86] var_1_8 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L89] var_1_10 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L92] var_1_11 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L95] var_1_15 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L98] var_1_20 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L115] RET updateVariables() [L116] CALL step() [L42] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L49] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L51] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L52] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L53] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=0] [L55] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L56] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L59] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L61] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L62] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L65] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L69] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L70] var_1_25 = var_1_20 [L71] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L72] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L73] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L77] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L116] RET step() [L117] CALL, EXPR property() [L106-L107] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=256, var_1_15=256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 338 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 161 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 184 mSDtfsCounter, 161 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=3, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 44 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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-10-11 11:48:48,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:48:50,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:48:50,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:48:50,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:48:50,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:48:50,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:48:50,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:48:50,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:48:50,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:48:50,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:48:50,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:48:50,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:48:50,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:48:50,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:48:50,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:48:50,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:48:50,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:48:50,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:48:50,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:48:50,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:48:50,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:48:50,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:48:50,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:48:50,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:48:50,430 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:48:50,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:48:50,431 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:48:50,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:48:50,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:48:50,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:48:50,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:48:50,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:48:50,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:48:50,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:48:50,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:48:50,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:48:50,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:48:50,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:48:50,435 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:48:50,436 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:48:50,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:48:50,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:48:50,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:48:50,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:48:50,437 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:48:50,437 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-clean/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-clean/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 -> 0a317ccf5ccba7274d910bf34daf53d91967ee1af8c7c38fb4b30f3de25d4d4d [2024-10-11 11:48:50,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:48:50,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:48:50,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:48:50,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:48:50,799 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:48:50,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i [2024-10-11 11:48:52,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:48:52,644 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:48:52,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-40.i [2024-10-11 11:48:52,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bf36a9bb3/cb91617e4f6c48b6b69ec9445d0bc258/FLAG09a9115c8 [2024-10-11 11:48:52,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bf36a9bb3/cb91617e4f6c48b6b69ec9445d0bc258 [2024-10-11 11:48:52,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:48:52,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:48:52,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:48:52,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:48:52,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:48:52,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:48:52" (1/1) ... [2024-10-11 11:48:52,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c98c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:52, skipping insertion in model container [2024-10-11 11:48:52,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:48:52" (1/1) ... [2024-10-11 11:48:52,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:48:52,905 WARN L248 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_50-1loop_file-40.i[915,928] [2024-10-11 11:48:52,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:48:52,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:48:53,012 WARN L248 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_50-1loop_file-40.i[915,928] [2024-10-11 11:48:53,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:48:53,072 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:48:53,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53 WrapperNode [2024-10-11 11:48:53,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:48:53,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:48:53,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:48:53,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:48:53,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,125 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-11 11:48:53,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:48:53,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:48:53,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:48:53,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:48:53,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,158 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-10-11 11:48:53,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:48:53,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:48:53,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:48:53,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:48:53,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (1/1) ... [2024-10-11 11:48:53,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:48:53,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:48:53,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:48:53,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:48:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:48:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:48:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:48:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:48:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:48:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:48:53,362 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:48:53,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:48:54,042 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 11:48:54,043 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:48:54,100 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:48:54,101 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:48:54,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:54 BoogieIcfgContainer [2024-10-11 11:48:54,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:48:54,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:48:54,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:48:54,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:48:54,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:48:52" (1/3) ... [2024-10-11 11:48:54,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19926e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:48:54, skipping insertion in model container [2024-10-11 11:48:54,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:48:53" (2/3) ... [2024-10-11 11:48:54,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19926e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:48:54, skipping insertion in model container [2024-10-11 11:48:54,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:48:54" (3/3) ... [2024-10-11 11:48:54,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-40.i [2024-10-11 11:48:54,127 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:48:54,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:48:54,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:48:54,194 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;@79f2e5f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:48:54,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:48:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 11:48:54,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:54,209 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:54,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:54,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:54,216 INFO L85 PathProgramCache]: Analyzing trace with hash 216116180, now seen corresponding path program 1 times [2024-10-11 11:48:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:48:54,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255598913] [2024-10-11 11:48:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:54,232 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-10-11 11:48:54,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:48:54,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 11:48:54,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:48:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:54,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:48:54,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:48:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-11 11:48:54,528 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:48:54,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:48:54,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255598913] [2024-10-11 11:48:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255598913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:54,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:54,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:48:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960917541] [2024-10-11 11:48:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:54,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:48:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:48:54,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:48:54,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:48:54,567 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:48:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:54,761 INFO L93 Difference]: Finished difference Result 87 states and 145 transitions. [2024-10-11 11:48:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:48:54,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-10-11 11:48:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:54,771 INFO L225 Difference]: With dead ends: 87 [2024-10-11 11:48:54,772 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 11:48:54,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-11 11:48:54,778 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:54,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:48:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 11:48:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 11:48:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-11 11:48:54,819 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 81 [2024-10-11 11:48:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:54,820 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-11 11:48:54,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:48:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-11 11:48:54,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:48:54,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:54,826 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:54,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:48:55,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 11:48:55,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1010997658, now seen corresponding path program 1 times [2024-10-11 11:48:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:48:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732124264] [2024-10-11 11:48:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:55,034 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-10-11 11:48:55,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:48:55,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 11:48:55,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:48:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:55,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:48:55,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:48:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:55,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:48:55,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:48:55,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732124264] [2024-10-11 11:48:55,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732124264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:55,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:55,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:48:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181051288] [2024-10-11 11:48:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:55,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:48:55,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:48:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:48:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:48:55,312 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:55,563 INFO L93 Difference]: Finished difference Result 83 states and 121 transitions. [2024-10-11 11:48:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:48:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-11 11:48:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:55,566 INFO L225 Difference]: With dead ends: 83 [2024-10-11 11:48:55,566 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 11:48:55,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-10-11 11:48:55,568 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:55,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:48:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 11:48:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 11:48:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:48:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2024-10-11 11:48:55,578 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 82 [2024-10-11 11:48:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:55,580 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2024-10-11 11:48:55,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2024-10-11 11:48:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:48:55,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:55,582 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:55,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:48:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 11:48:55,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1508962276, now seen corresponding path program 1 times [2024-10-11 11:48:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:48:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598814183] [2024-10-11 11:48:55,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:55,785 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-10-11 11:48:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:48:55,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 11:48:55,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:48:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:55,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:48:56,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:48:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:48:56,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:48:56,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:48:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598814183] [2024-10-11 11:48:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598814183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:48:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:48:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:48:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003195992] [2024-10-11 11:48:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:48:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:48:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:48:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:48:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:48:56,237 INFO L87 Difference]: Start difference. First operand 42 states and 60 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:48:57,486 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-10-11 11:48:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:48:57,487 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-11 11:48:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:48:57,489 INFO L225 Difference]: With dead ends: 180 [2024-10-11 11:48:57,489 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 11:48:57,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:48:57,491 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 110 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:48:57,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 241 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 11:48:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 11:48:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 82. [2024-10-11 11:48:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 55 states have internal predecessors, (67), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:48:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-10-11 11:48:57,522 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 82 [2024-10-11 11:48:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:48:57,525 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-10-11 11:48:57,525 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:48:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-10-11 11:48:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 11:48:57,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:48:57,527 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:48:57,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 11:48:57,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 11:48:57,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:48:57,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:48:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1508902694, now seen corresponding path program 1 times [2024-10-11 11:48:57,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:48:57,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825702012] [2024-10-11 11:48:57,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:48:57,732 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-10-11 11:48:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:48:57,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 11:48:57,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:48:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:48:57,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 11:48:57,915 INFO L278 TraceCheckSpWp]: Computing forward predicates...