./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_100-while_file-12.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 b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:05:50,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:05:50,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:05:50,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:05:50,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:05:50,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:05:50,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:05:50,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:05:50,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:05:50,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:05:50,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:05:50,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:05:50,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:05:50,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:05:50,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:05:50,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:05:50,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:50,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:05:50,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:05:50,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a [2025-03-08 14:05:50,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:05:50,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:05:50,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:05:50,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:05:50,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:05:50,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-08 14:05:51,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda05da37/b6674e992bfa4fe9a8f4da9cc7156664/FLAGc01eaee4f [2025-03-08 14:05:52,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:05:52,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-08 14:05:52,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda05da37/b6674e992bfa4fe9a8f4da9cc7156664/FLAGc01eaee4f [2025-03-08 14:05:52,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bda05da37/b6674e992bfa4fe9a8f4da9cc7156664 [2025-03-08 14:05:52,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:05:52,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:05:52,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:52,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:05:52,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:05:52,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab61f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52, skipping insertion in model container [2025-03-08 14:05:52,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:05:52,634 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_100-while_file-12.i[916,929] [2025-03-08 14:05:52,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:52,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:05:52,710 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_100-while_file-12.i[916,929] [2025-03-08 14:05:52,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:05:52,756 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:05:52,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52 WrapperNode [2025-03-08 14:05:52,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:05:52,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:52,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:05:52,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:05:52,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,796 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-08 14:05:52,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:05:52,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:05:52,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:05:52,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:05:52,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,827 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]. [2025-03-08 14:05:52,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:05:52,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:05:52,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:05:52,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:05:52,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (1/1) ... [2025-03-08 14:05:52,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:52,877 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) [2025-03-08 14:05:52,880 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 [2025-03-08 14:05:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:05:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:05:52,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:05:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:05:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:05:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:05:52,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:05:52,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:05:53,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-08 14:05:53,359 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 14:05:53,360 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:05:53,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:05:53,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:05:53,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:53 BoogieIcfgContainer [2025-03-08 14:05:53,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:05:53,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:05:53,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:05:53,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:05:53,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:05:52" (1/3) ... [2025-03-08 14:05:53,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a71b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:53, skipping insertion in model container [2025-03-08 14:05:53,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:05:52" (2/3) ... [2025-03-08 14:05:53,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a71b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:05:53, skipping insertion in model container [2025-03-08 14:05:53,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:53" (3/3) ... [2025-03-08 14:05:53,384 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-08 14:05:53,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:05:53,397 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-12.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:05:53,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:05:53,446 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;@4973cffe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:05:53,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:05:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:05:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 14:05:53,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:53,459 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:53,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:53,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1575000491, now seen corresponding path program 1 times [2025-03-08 14:05:53,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:53,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906193627] [2025-03-08 14:05:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:53,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 14:05:53,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 14:05:53,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:53,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 14:05:53,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:53,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906193627] [2025-03-08 14:05:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906193627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:05:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559711157] [2025-03-08 14:05:53,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:53,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:53,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:53,687 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) [2025-03-08 14:05:53,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:05:53,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 14:05:53,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 14:05:53,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:53,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:53,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:05:53,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 14:05:53,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559711157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:05:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:05:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948155087] [2025-03-08 14:05:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:05:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:53,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:05:53,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:05:53,875 INFO L87 Difference]: Start difference. First operand has 82 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 59 states have internal predecessors, (86), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:05:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:53,900 INFO L93 Difference]: Finished difference Result 158 states and 272 transitions. [2025-03-08 14:05:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:05:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2025-03-08 14:05:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:53,907 INFO L225 Difference]: With dead ends: 158 [2025-03-08 14:05:53,908 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 14:05:53,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:05:53,913 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:53,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:05:53,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 14:05:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-08 14:05:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:05:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2025-03-08 14:05:53,950 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 142 [2025-03-08 14:05:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:53,950 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2025-03-08 14:05:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:05:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2025-03-08 14:05:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 14:05:53,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:53,954 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:53,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:05:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:05:54,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -5572010, now seen corresponding path program 1 times [2025-03-08 14:05:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198422789] [2025-03-08 14:05:54,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:54,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 14:05:54,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 14:05:54,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:54,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:05:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198422789] [2025-03-08 14:05:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198422789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:05:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505246862] [2025-03-08 14:05:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:54,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:05:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:54,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:05:54,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:54,352 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:54,395 INFO L93 Difference]: Finished difference Result 184 states and 289 transitions. [2025-03-08 14:05:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:05:54,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2025-03-08 14:05:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:54,397 INFO L225 Difference]: With dead ends: 184 [2025-03-08 14:05:54,398 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 14:05:54,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:54,400 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:54,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 229 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:05:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 14:05:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 85. [2025-03-08 14:05:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 62 states have internal predecessors, (92), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:05:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2025-03-08 14:05:54,408 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 142 [2025-03-08 14:05:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2025-03-08 14:05:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2025-03-08 14:05:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 14:05:54,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:54,412 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:54,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:05:54,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1802523369, now seen corresponding path program 1 times [2025-03-08 14:05:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240469766] [2025-03-08 14:05:54,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:54,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 14:05:54,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 14:05:54,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:54,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:05:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240469766] [2025-03-08 14:05:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240469766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:05:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043999151] [2025-03-08 14:05:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:54,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:05:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:54,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:05:54,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:54,565 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:54,628 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2025-03-08 14:05:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:05:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2025-03-08 14:05:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:54,631 INFO L225 Difference]: With dead ends: 207 [2025-03-08 14:05:54,631 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 14:05:54,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:05:54,633 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:54,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:05:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 14:05:54,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2025-03-08 14:05:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 86 states have internal predecessors, (117), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 14:05:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2025-03-08 14:05:54,646 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 142 [2025-03-08 14:05:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:54,646 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2025-03-08 14:05:54,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2025-03-08 14:05:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:05:54,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:54,648 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:54,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:05:54,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:54,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash -643062951, now seen corresponding path program 1 times [2025-03-08 14:05:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475724282] [2025-03-08 14:05:54,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:54,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:54,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:05:54,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:05:54,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:54,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:05:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475724282] [2025-03-08 14:05:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475724282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:55,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:05:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614735626] [2025-03-08 14:05:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:55,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:05:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:55,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:05:55,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:05:55,218 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:55,291 INFO L93 Difference]: Finished difference Result 236 states and 356 transitions. [2025-03-08 14:05:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:05:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2025-03-08 14:05:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:55,295 INFO L225 Difference]: With dead ends: 236 [2025-03-08 14:05:55,297 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 14:05:55,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:05:55,299 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:55,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 489 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:05:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 14:05:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-08 14:05:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 14:05:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-08 14:05:55,315 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 143 [2025-03-08 14:05:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:55,315 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-08 14:05:55,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-08 14:05:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 14:05:55,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:55,320 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:05:55,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -334604521, now seen corresponding path program 1 times [2025-03-08 14:05:55,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371809737] [2025-03-08 14:05:55,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:55,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 14:05:55,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 14:05:55,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:55,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:05:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269523783] [2025-03-08 14:05:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:55,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:55,460 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) [2025-03-08 14:05:55,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:05:55,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 14:05:55,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 14:05:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:05:55,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 14:05:55,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:05:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:05:55,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:05:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:05:55,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371809737] [2025-03-08 14:05:55,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:05:55,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269523783] [2025-03-08 14:05:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269523783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:05:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:05:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:05:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858062931] [2025-03-08 14:05:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:05:55,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:05:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:05:55,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:05:55,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:05:55,981 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:05:56,114 INFO L93 Difference]: Finished difference Result 345 states and 517 transitions. [2025-03-08 14:05:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:05:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2025-03-08 14:05:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:05:56,117 INFO L225 Difference]: With dead ends: 345 [2025-03-08 14:05:56,117 INFO L226 Difference]: Without dead ends: 229 [2025-03-08 14:05:56,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:05:56,118 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:05:56,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 311 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:05:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-08 14:05:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 159. [2025-03-08 14:05:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 104 states have internal predecessors, (133), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 14:05:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 237 transitions. [2025-03-08 14:05:56,145 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 237 transitions. Word has length 145 [2025-03-08 14:05:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:05:56,145 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 237 transitions. [2025-03-08 14:05:56,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:05:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 237 transitions. [2025-03-08 14:05:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 14:05:56,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:05:56,147 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:05:56,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:05:56,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:56,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:05:56,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:05:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 910159960, now seen corresponding path program 1 times [2025-03-08 14:05:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:05:56,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585419008] [2025-03-08 14:05:56,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:05:56,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 14:05:56,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 14:05:56,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:56,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:05:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748994630] [2025-03-08 14:05:56,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:05:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:56,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:05:56,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:05:56,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:05:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 14:05:56,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 14:05:56,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:56,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:05:56,604 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:05:56,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 14:05:56,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 14:05:56,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:05:56,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:05:56,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:05:56,709 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:05:56,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:05:56,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:05:56,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:05:56,914 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 14:05:56,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:05:56,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:05:56 BoogieIcfgContainer [2025-03-08 14:05:56,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:05:56,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:05:56,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:05:56,990 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:05:56,991 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:05:53" (3/4) ... [2025-03-08 14:05:56,992 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:05:56,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:05:56,993 INFO L158 Benchmark]: Toolchain (without parser) took 4504.18ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 93.9MB in the end (delta: 27.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-03-08 14:05:56,993 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:05:56,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.88ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 105.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:05:56,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.69ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 101.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:05:56,994 INFO L158 Benchmark]: Boogie Preprocessor took 50.46ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 94.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:05:56,994 INFO L158 Benchmark]: IcfgBuilder took 526.91ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 66.2MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 14:05:56,994 INFO L158 Benchmark]: TraceAbstraction took 3611.71ms. Allocated memory is still 167.8MB. Free memory was 65.3MB in the beginning and 93.9MB in the end (delta: -28.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:05:56,995 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:05:56,995 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.21ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.88ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 105.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.69ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 101.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.46ms. Allocated memory is still 167.8MB. Free memory was 101.1MB in the beginning and 94.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 526.91ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 66.2MB in the end (delta: 28.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3611.71ms. Allocated memory is still 167.8MB. Free memory was 65.3MB in the beginning and 93.9MB in the end (delta: -28.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 50.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 100; [L23] unsigned char var_1_5 = 0; [L24] double var_1_6 = 4.5; [L25] unsigned char var_1_7 = 2; [L26] unsigned char var_1_8 = 2; [L27] double var_1_12 = 16.4; [L28] signed long int var_1_13 = 32; [L29] signed short int var_1_15 = -10; [L30] signed long int var_1_16 = -5; [L31] unsigned char var_1_17 = 1; [L32] signed short int var_1_18 = 500; [L33] double var_1_19 = 32.5; [L34] signed char var_1_20 = 0; [L35] double var_1_21 = 2.5; [L36] double var_1_22 = 0.0; [L37] double var_1_23 = 9.6; [L38] unsigned char var_1_24 = 64; [L39] unsigned char var_1_25 = 0; [L40] unsigned short int var_1_26 = 8; [L41] unsigned short int var_1_28 = 16; [L42] double var_1_29 = 200.5; [L43] unsigned short int var_1_30 = 20701; [L44] double last_1_var_1_6 = 4.5; [L45] signed long int last_1_var_1_16 = -5; [L46] signed short int last_1_var_1_18 = 500; [L47] signed char last_1_var_1_20 = 0; [L48] double last_1_var_1_21 = 2.5; [L49] unsigned char last_1_var_1_24 = 64; [L50] unsigned short int last_1_var_1_26 = 8; [L51] unsigned short int last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_16 = var_1_16 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L185] last_1_var_1_24 = var_1_24 [L186] last_1_var_1_26 = var_1_26 [L187] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L145] var_1_5 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L146] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_7 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L150] RET assume_abort_if_not(var_1_7 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L153] CALL assume_abort_if_not(var_1_8 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L153] RET assume_abort_if_not(var_1_8 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L156] var_1_15 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L157] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L161] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L165] var_1_22 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L166] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L167] var_1_23 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L168] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L172] var_1_29 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L175] var_1_30 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_30 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L176] RET assume_abort_if_not(var_1_30 >= 16383) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L198] RET updateVariables() [L199] CALL step() [L55] unsigned char stepLocal_0 = ! var_1_5; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_0=1, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L56] COND FALSE !(((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && stepLocal_0) [L59] var_1_1 = last_1_var_1_26 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] signed long int stepLocal_1 = (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))); [L62] COND FALSE !(last_1_var_1_18 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L69] signed long int stepLocal_3 = last_1_var_1_26 + var_1_8; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L70] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L81] COND TRUE ! (last_1_var_1_18 <= (var_1_7 / var_1_15)) [L82] var_1_21 = ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L86] COND FALSE !(var_1_17 || (var_1_8 >= last_1_var_1_24)) [L91] var_1_24 = var_1_7 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L93] COND FALSE !(var_1_19 == var_1_21) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L100] COND FALSE !(var_1_5 && var_1_17) [L103] var_1_16 = (var_1_8 - var_1_7) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L105] unsigned char stepLocal_2 = var_1_24; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L106] COND TRUE var_1_21 > var_1_21 [L107] var_1_13 = (var_1_7 - var_1_24) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L115] COND FALSE !(\read(var_1_17)) [L122] var_1_28 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L124] COND TRUE ! var_1_17 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L125] COND FALSE !(\read(var_1_17)) [L138] var_1_26 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190-L191] return ((((((((((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1)) && ((var_1_21 > var_1_21) ? (var_1_13 == ((signed long int) (var_1_7 - var_1_24))) : (((var_1_16 / var_1_15) < var_1_24) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_15))))) && ((var_1_5 && var_1_17) ? (var_1_16 == ((signed long int) ((((last_1_var_1_16) > (var_1_15)) ? (last_1_var_1_16) : (var_1_15))))) : (var_1_16 == ((signed long int) (var_1_8 - var_1_7))))) && (var_1_5 ? ((((((last_1_var_1_6) < ((1.0000000075E8 - var_1_19))) ? (last_1_var_1_6) : ((1.0000000075E8 - var_1_19)))) > var_1_12) ? (((last_1_var_1_26 + var_1_8) >= last_1_var_1_24) ? (var_1_18 == ((signed short int) var_1_7)) : (var_1_18 == ((signed short int) last_1_var_1_24))) : (var_1_18 == ((signed short int) var_1_8))) : 1)) && ((var_1_19 == var_1_21) ? ((! var_1_17) ? (var_1_20 == ((signed char) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_20 == ((signed char) var_1_7))) : 1)) && ((! (last_1_var_1_18 <= (var_1_7 / var_1_15))) ? (var_1_21 == ((double) ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))))) : (var_1_21 == ((double) var_1_22)))) && ((var_1_17 || (var_1_8 >= last_1_var_1_24)) ? ((var_1_17 && (var_1_21 != var_1_23)) ? (var_1_24 == ((unsigned char) ((((var_1_7) < (var_1_25)) ? (var_1_7) : (var_1_25))))) : 1) : (var_1_24 == ((unsigned char) var_1_7)))) && ((! var_1_17) ? (var_1_17 ? ((var_1_6 <= ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) ? ((var_1_19 <= ((var_1_12 + var_1_6) / var_1_22)) ? (((~ var_1_24) > var_1_1) ? (var_1_26 == ((unsigned short int) var_1_13)) : (var_1_26 == ((unsigned short int) var_1_7))) : 1) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_8)))) && (var_1_17 ? ((var_1_21 <= ((var_1_6 / var_1_22) + (var_1_21 / var_1_29))) ? (var_1_28 == ((unsigned short int) ((59265 - ((((var_1_8) > (var_1_18)) ? (var_1_8) : (var_1_18)))) - (var_1_30 - var_1_13)))) : (var_1_28 == ((unsigned short int) var_1_13))) : (var_1_28 == ((unsigned short int) var_1_1))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 149 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 1385 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 594 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=5, InterpolantAutomatonStates: 16, 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, 5 MinimizatonAttempts, 100 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1291 NumberOfCodeBlocks, 1291 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 850 ConstructedInterpolants, 0 QuantifiedInterpolants, 1988 SizeOfPredicates, 5 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5000/5040 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:05:57,013 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/21.0.5-tem/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.6.800.v20240513-1750.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_100-while_file-12.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 b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:05:58,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:05:58,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:05:58,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:05:58,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:05:58,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:05:58,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:05:58,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:05:58,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:05:58,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:05:58,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:05:58,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:05:58,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:05:58,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:05:58,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:05:58,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:05:58,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:05:58,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:05:58,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:05:58,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:05:58,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:05:58,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:05:58,972 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:05:58,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:05:58,973 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a [2025-03-08 14:05:59,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:05:59,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:05:59,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:05:59,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:05:59,228 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:05:59,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-08 14:06:00,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53dc42c53/57c254d6face40ee96938c45726a07b3/FLAG806f9e05e [2025-03-08 14:06:00,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:06:00,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-08 14:06:00,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53dc42c53/57c254d6face40ee96938c45726a07b3/FLAG806f9e05e [2025-03-08 14:06:00,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53dc42c53/57c254d6face40ee96938c45726a07b3 [2025-03-08 14:06:01,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:06:01,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:06:01,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:06:01,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:06:01,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:06:01,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:00" (1/1) ... [2025-03-08 14:06:01,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20df99d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01, skipping insertion in model container [2025-03-08 14:06:01,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:00" (1/1) ... [2025-03-08 14:06:01,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:06:01,109 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_100-while_file-12.i[916,929] [2025-03-08 14:06:01,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:06:01,181 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:06:01,191 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_100-while_file-12.i[916,929] [2025-03-08 14:06:01,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:06:01,237 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:06:01,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01 WrapperNode [2025-03-08 14:06:01,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:06:01,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:06:01,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:06:01,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:06:01,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,284 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-08 14:06:01,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:06:01,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:06:01,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:06:01,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:06:01,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,310 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]. [2025-03-08 14:06:01,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:06:01,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:06:01,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:06:01,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:06:01,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (1/1) ... [2025-03-08 14:06:01,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:06:01,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:06:01,355 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) [2025-03-08 14:06:01,361 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 [2025-03-08 14:06:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:06:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:06:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:06:01,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:06:01,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:06:01,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:06:01,430 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:06:01,431 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:06:26,242 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 14:06:26,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:06:26,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:06:26,249 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:06:26,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:26 BoogieIcfgContainer [2025-03-08 14:06:26,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:06:26,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:06:26,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:06:26,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:06:26,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:06:00" (1/3) ... [2025-03-08 14:06:26,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2a36ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:26, skipping insertion in model container [2025-03-08 14:06:26,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:01" (2/3) ... [2025-03-08 14:06:26,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2a36ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:26, skipping insertion in model container [2025-03-08 14:06:26,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:26" (3/3) ... [2025-03-08 14:06:26,258 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-12.i [2025-03-08 14:06:26,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:06:26,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-12.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:06:26,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:06:26,317 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;@1e523fe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:06:26,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:06:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:06:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 14:06:26,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:26,332 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:26,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1437092757, now seen corresponding path program 1 times [2025-03-08 14:06:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:06:26,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774373617] [2025-03-08 14:06:26,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:26,349 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 [2025-03-08 14:06:26,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:06:26,351 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) [2025-03-08 14:06:26,354 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 [2025-03-08 14:06:26,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 14:06:27,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 14:06:27,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:27,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:27,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:06:27,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-03-08 14:06:27,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:06:27,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:06:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774373617] [2025-03-08 14:06:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774373617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:06:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:06:27,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:06:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087149843] [2025-03-08 14:06:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:06:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:06:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:06:27,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:06:27,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:06:27,875 INFO L87 Difference]: Start difference. First operand has 75 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 52 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:06:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:06:27,899 INFO L93 Difference]: Finished difference Result 144 states and 252 transitions. [2025-03-08 14:06:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:06:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2025-03-08 14:06:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:06:27,907 INFO L225 Difference]: With dead ends: 144 [2025-03-08 14:06:27,908 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 14:06:27,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:06:27,913 INFO L435 NwaCegarLoop]: 112 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, 112 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 [2025-03-08 14:06:27,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:06:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 14:06:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 14:06:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:06:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2025-03-08 14:06:27,946 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 139 [2025-03-08 14:06:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:06:27,946 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2025-03-08 14:06:27,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:06:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2025-03-08 14:06:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 14:06:27,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:06:27,948 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:06:27,983 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 [2025-03-08 14:06:28,149 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 [2025-03-08 14:06:28,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:06:28,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:06:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1128454634, now seen corresponding path program 1 times [2025-03-08 14:06:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:06:28,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374495953] [2025-03-08 14:06:28,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:06:28,151 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 [2025-03-08 14:06:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:06:28,154 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) [2025-03-08 14:06:28,155 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 [2025-03-08 14:06:28,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 14:06:29,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 14:06:29,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:06:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:06:29,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:06:29,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:06:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:06:43,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:06:43,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:06:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374495953] [2025-03-08 14:06:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374495953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:06:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:06:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:06:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012745262] [2025-03-08 14:06:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:06:43,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:06:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:06:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:06:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:06:43,552 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:06:48,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:06:53,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:06:57,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:02,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:06,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:10,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:15,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:20,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:25,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:29,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:07:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:07:29,125 INFO L93 Difference]: Finished difference Result 217 states and 341 transitions. [2025-03-08 14:07:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:07:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2025-03-08 14:07:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:07:29,416 INFO L225 Difference]: With dead ends: 217 [2025-03-08 14:07:29,416 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 14:07:29,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:07:29,417 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 106 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:07:29,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 315 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 45.3s Time] [2025-03-08 14:07:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 14:07:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2025-03-08 14:07:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 14:07:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2025-03-08 14:07:29,442 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 140 [2025-03-08 14:07:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:07:29,442 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2025-03-08 14:07:29,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:07:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2025-03-08 14:07:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 14:07:29,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:07:29,444 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:07:29,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 14:07:29,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:07:29,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:07:29,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:07:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2125526987, now seen corresponding path program 1 times [2025-03-08 14:07:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:07:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984949764] [2025-03-08 14:07:29,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:07:29,646 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 [2025-03-08 14:07:29,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:07:29,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:07:29,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:07:29,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 14:07:31,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 14:07:31,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:07:31,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:07:31,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 14:07:31,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:07:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:07:31,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:07:31,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:07:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984949764] [2025-03-08 14:07:31,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984949764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:07:31,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:07:31,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:07:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574196288] [2025-03-08 14:07:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:07:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:07:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:07:31,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:07:31,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:07:31,729 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21)