./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:47:12,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:47:12,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:47:12,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:47:12,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:47:12,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:47:12,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:47:12,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:47:12,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:47:12,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:47:12,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:47:12,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:47:12,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:47:12,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:47:12,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:47:12,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:47:12,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:47:12,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:47:12,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:47:12,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:47:12,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:47:12,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:47:12,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:47:12,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:47:12,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:47:12,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:47:12,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:47:12,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:47:12,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:47:12,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:47:12,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:47:12,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:47:12,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:47:12,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:47:12,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:47:12,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:47:12,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:47:12,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:47:12,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:47:12,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:47:12,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:47:12,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:47:12,611 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 [2024-11-12 05:47:12,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:47:12,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:47:12,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:47:12,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:47:12,911 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:47:12,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-11-12 05:47:14,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:47:14,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:47:14,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-11-12 05:47:14,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01412bbd4/778909e51d08482f88eafd7da02105ea/FLAGfd3994043 [2024-11-12 05:47:14,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01412bbd4/778909e51d08482f88eafd7da02105ea [2024-11-12 05:47:14,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:47:14,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:47:14,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:47:14,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:47:14,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:47:14,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:47:14" (1/1) ... [2024-11-12 05:47:14,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8fd1565 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:14, skipping insertion in model container [2024-11-12 05:47:14,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:47:14" (1/1) ... [2024-11-12 05:47:14,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:47:15,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-11-12 05:47:15,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:47:15,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:47:15,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-11-12 05:47:15,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:47:15,208 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:47:15,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15 WrapperNode [2024-11-12 05:47:15,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:47:15,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:47:15,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:47:15,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:47:15,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,293 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-12 05:47:15,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:47:15,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:47:15,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:47:15,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:47:15,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,340 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:47:15,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:47:15,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:47:15,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:47:15,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:47:15,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (1/1) ... [2024-11-12 05:47:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:47:15,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:47:15,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:47:15,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:47:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:47:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:47:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:47:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:47:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:47:15,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:47:15,580 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:47:15,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:47:16,073 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 05:47:16,074 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:47:16,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:47:16,090 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:47:16,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:16 BoogieIcfgContainer [2024-11-12 05:47:16,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:47:16,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:47:16,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:47:16,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:47:16,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:47:14" (1/3) ... [2024-11-12 05:47:16,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1505fd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:47:16, skipping insertion in model container [2024-11-12 05:47:16,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:15" (2/3) ... [2024-11-12 05:47:16,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1505fd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:47:16, skipping insertion in model container [2024-11-12 05:47:16,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:16" (3/3) ... [2024-11-12 05:47:16,100 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-11-12 05:47:16,117 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:47:16,118 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:47:16,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:47:16,202 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;@189d1783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:47:16,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:47:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:47:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-12 05:47:16,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:16,245 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:16,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:16,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1166809759, now seen corresponding path program 1 times [2024-11-12 05:47:16,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:16,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724856895] [2024-11-12 05:47:16,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:47:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:47:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:47:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:47:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:47:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:47:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:47:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:47:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:47:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:47:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:47:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:47:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:47:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:47:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:47:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:47:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:47:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:47:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:47:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 05:47:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:47:16,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724856895] [2024-11-12 05:47:16,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724856895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:47:16,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:47:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:47:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286975353] [2024-11-12 05:47:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:47:16,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:47:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:47:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:47:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:47:16,848 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:47:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:47:16,888 INFO L93 Difference]: Finished difference Result 155 states and 258 transitions. [2024-11-12 05:47:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:47:16,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2024-11-12 05:47:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:47:16,901 INFO L225 Difference]: With dead ends: 155 [2024-11-12 05:47:16,902 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 05:47:16,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:47:16,912 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:47:16,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:47:16,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 05:47:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-12 05:47:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:47:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-12 05:47:16,972 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 124 [2024-11-12 05:47:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:47:16,974 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-12 05:47:16,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:47:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-12 05:47:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-12 05:47:16,979 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:16,980 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:47:16,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:16,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1123158233, now seen corresponding path program 1 times [2024-11-12 05:47:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:16,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507114551] [2024-11-12 05:47:16,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:16,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:47:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:47:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:47:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:47:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:47:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:47:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:47:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:47:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:47:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:47:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:47:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:47:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:47:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:47:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:47:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:47:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:47:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:47:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:47:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 108 proven. 102 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2024-11-12 05:47:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:47:18,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507114551] [2024-11-12 05:47:18,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507114551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:47:18,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844562900] [2024-11-12 05:47:18,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:18,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:47:18,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:47:18,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:47:18,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:47:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:18,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 05:47:18,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:47:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 473 proven. 102 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-12 05:47:20,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:47:21,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844562900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:47:21,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:47:21,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 22 [2024-11-12 05:47:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158394177] [2024-11-12 05:47:21,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:47:21,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 05:47:21,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:47:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 05:47:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-11-12 05:47:21,167 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) [2024-11-12 05:47:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:47:22,046 INFO L93 Difference]: Finished difference Result 175 states and 248 transitions. [2024-11-12 05:47:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 05:47:22,047 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) Word has length 124 [2024-11-12 05:47:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:47:22,051 INFO L225 Difference]: With dead ends: 175 [2024-11-12 05:47:22,051 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 05:47:22,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=691, Invalid=1961, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 05:47:22,055 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 335 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:47:22,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 227 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:47:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 05:47:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-12 05:47:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:47:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2024-11-12 05:47:22,081 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 124 [2024-11-12 05:47:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:47:22,081 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2024-11-12 05:47:22,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (31), 9 states have call predecessors, (31), 9 states have call successors, (31) [2024-11-12 05:47:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-11-12 05:47:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-12 05:47:22,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:22,085 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:22,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:47:22,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:47:22,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:22,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:22,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1116183530, now seen corresponding path program 1 times [2024-11-12 05:47:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:22,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633896659] [2024-11-12 05:47:22,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:22,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:47:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525970955] [2024-11-12 05:47:22,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:22,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:47:22,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:47:22,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:47:22,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:47:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:47:22,789 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:47:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:47:22,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:47:22,915 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:47:22,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:47:22,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:47:23,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 05:47:23,122 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 05:47:23,230 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:47:23,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:47:23 BoogieIcfgContainer [2024-11-12 05:47:23,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:47:23,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:47:23,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:47:23,240 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:47:23,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:16" (3/4) ... [2024-11-12 05:47:23,244 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:47:23,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:47:23,246 INFO L158 Benchmark]: Toolchain (without parser) took 8477.62ms. Allocated memory was 165.7MB in the beginning and 270.5MB in the end (delta: 104.9MB). Free memory was 109.5MB in the beginning and 197.6MB in the end (delta: -88.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-12 05:47:23,247 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:47:23,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.60ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 93.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:47:23,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.29ms. Allocated memory is still 165.7MB. Free memory was 93.5MB in the beginning and 88.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:47:23,248 INFO L158 Benchmark]: Boogie Preprocessor took 96.79ms. Allocated memory is still 165.7MB. Free memory was 88.0MB in the beginning and 80.9MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:47:23,249 INFO L158 Benchmark]: RCFGBuilder took 698.28ms. Allocated memory is still 165.7MB. Free memory was 80.9MB in the beginning and 51.2MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 05:47:23,249 INFO L158 Benchmark]: TraceAbstraction took 7146.04ms. Allocated memory was 165.7MB in the beginning and 270.5MB in the end (delta: 104.9MB). Free memory was 50.2MB in the beginning and 197.6MB in the end (delta: -147.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:47:23,249 INFO L158 Benchmark]: Witness Printer took 5.67ms. Allocated memory is still 270.5MB. Free memory is still 197.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:47:23,251 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.19ms. Allocated memory is still 165.7MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.60ms. Allocated memory is still 165.7MB. Free memory was 109.3MB in the beginning and 93.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.29ms. Allocated memory is still 165.7MB. Free memory was 93.5MB in the beginning and 88.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.79ms. Allocated memory is still 165.7MB. Free memory was 88.0MB in the beginning and 80.9MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 698.28ms. Allocated memory is still 165.7MB. Free memory was 80.9MB in the beginning and 51.2MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7146.04ms. Allocated memory was 165.7MB in the beginning and 270.5MB in the end (delta: 104.9MB). Free memory was 50.2MB in the beginning and 197.6MB in the end (delta: -147.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.67ms. Allocated memory is still 270.5MB. Free memory is still 197.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=0, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L110] isInitial = 1 [L111] FCALL initially() [L112] int k_loop; [L113] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=0, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L113] COND TRUE k_loop < 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L79] var_1_6 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L80] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L81] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L81] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L82] var_1_8 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L83] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L84] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L84] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=16] [L85] var_1_9 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L86] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190] [L87] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L87] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L88] var_1_10 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L89] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L90] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L93] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L94] var_1_17 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L95] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L96] var_1_18 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L97] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L98] var_1_20 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L99] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L100] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L101] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=190, var_1_9=0] [L115] RET updateVariables() [L116] CALL step() [L42] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) [L43] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L44] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L51] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L58] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L59] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L59] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L60] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L65] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L66] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L68] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L69] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=90, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L116] RET step() [L117] CALL, EXPR property() [L106] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L106-L107] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741642, var_1_20=1, var_1_22=10, var_1_23=1, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=90, var_1_8=190, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 345 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 183 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 2214 SizeOfPredicates, 5 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1848/2052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:47:23,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:47:25,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:47:25,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:47:25,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:47:25,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:47:25,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:47:25,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:47:25,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:47:25,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:47:25,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:47:25,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:47:25,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:47:25,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:47:25,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:47:25,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:47:25,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:47:25,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:47:25,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:47:25,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:47:25,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:47:25,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:47:25,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:47:25,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:47:25,768 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:47:25,768 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:47:25,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:47:25,769 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:47:25,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:47:25,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:47:25,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:47:25,770 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:47:25,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:47:25,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:47:25,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:47:25,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:47:25,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:47:25,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:47:25,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:47:25,774 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:47:25,775 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:47:25,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:47:25,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:47:25,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:47:25,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:47:25,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 [2024-11-12 05:47:26,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:47:26,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:47:26,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:47:26,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:47:26,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:47:26,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-11-12 05:47:27,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:47:28,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:47:28,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-11-12 05:47:28,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de314129/6aa96b2b8e0c408eb63bf80a8760ee11/FLAG17f93f6da [2024-11-12 05:47:28,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de314129/6aa96b2b8e0c408eb63bf80a8760ee11 [2024-11-12 05:47:28,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:47:28,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:47:28,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:47:28,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:47:28,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:47:28,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fcfa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28, skipping insertion in model container [2024-11-12 05:47:28,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:47:28,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-11-12 05:47:28,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:47:28,748 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:47:28,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-11-12 05:47:28,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:47:28,825 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:47:28,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28 WrapperNode [2024-11-12 05:47:28,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:47:28,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:47:28,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:47:28,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:47:28,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,891 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-11-12 05:47:28,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:47:28,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:47:28,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:47:28,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:47:28,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,927 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:47:28,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:47:28,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:47:28,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:47:28,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:47:28,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (1/1) ... [2024-11-12 05:47:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:47:29,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:47:29,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:47:29,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:47:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:47:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:47:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:47:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:47:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:47:29,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:47:29,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:47:29,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:47:31,445 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 05:47:31,445 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:47:31,461 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:47:31,462 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:47:31,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:31 BoogieIcfgContainer [2024-11-12 05:47:31,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:47:31,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:47:31,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:47:31,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:47:31,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:47:28" (1/3) ... [2024-11-12 05:47:31,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c7e65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:47:31, skipping insertion in model container [2024-11-12 05:47:31,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:28" (2/3) ... [2024-11-12 05:47:31,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c7e65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:47:31, skipping insertion in model container [2024-11-12 05:47:31,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:31" (3/3) ... [2024-11-12 05:47:31,472 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-11-12 05:47:31,491 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:47:31,491 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:47:31,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:47:31,573 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;@20a3a398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:47:31,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:47:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:47:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 05:47:31,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:31,587 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:31,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:31,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 496008502, now seen corresponding path program 1 times [2024-11-12 05:47:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:47:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527273907] [2024-11-12 05:47:31,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:31,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:47:31,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:47:31,613 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:47:31,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:47:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:32,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:47:32,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:47:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-12 05:47:32,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:47:32,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:47:32,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527273907] [2024-11-12 05:47:32,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527273907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:47:32,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:47:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:47:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722022488] [2024-11-12 05:47:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:47:32,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:47:32,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:47:32,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:47:32,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:47:32,181 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:47:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:47:32,205 INFO L93 Difference]: Finished difference Result 111 states and 186 transitions. [2024-11-12 05:47:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:47:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-11-12 05:47:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:47:32,216 INFO L225 Difference]: With dead ends: 111 [2024-11-12 05:47:32,217 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 05:47:32,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:47:32,224 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:47:32,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:47:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 05:47:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-12 05:47:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 05:47:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2024-11-12 05:47:32,264 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 120 [2024-11-12 05:47:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:47:32,265 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2024-11-12 05:47:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 05:47:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2024-11-12 05:47:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 05:47:32,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:32,269 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:32,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:47:32,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:47:32,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:32,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2008377232, now seen corresponding path program 1 times [2024-11-12 05:47:32,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:47:32,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082360238] [2024-11-12 05:47:32,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:32,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:47:32,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:47:32,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:47:32,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:47:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:32,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 05:47:32,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:47:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 498 proven. 117 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-12 05:47:54,734 INFO L312 TraceCheckSpWp]: Computing backward predicates...