./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:08:56,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:08:56,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:08:56,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:08:56,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:08:56,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:08:56,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:08:56,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:08:56,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:08:56,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:08:56,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:08:56,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:08:56,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:08:56,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:08:56,509 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:08:56,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:08:56,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:08:56,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:08:56,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:08:56,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:08:56,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:08:56,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:08:56,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:08:56,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:08:56,512 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2025-03-08 11:08:56,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:08:56,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:08:56,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:08:56,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:08:56,749 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:08:56,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-08 11:08:57,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61575fde1/0629649e437441839bbd0846fff6ff69/FLAG1ae5e6320 [2025-03-08 11:08:58,174 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:08:58,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-08 11:08:58,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61575fde1/0629649e437441839bbd0846fff6ff69/FLAG1ae5e6320 [2025-03-08 11:08:58,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61575fde1/0629649e437441839bbd0846fff6ff69 [2025-03-08 11:08:58,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:08:58,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:08:58,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:08:58,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:08:58,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:08:58,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4366b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58, skipping insertion in model container [2025-03-08 11:08:58,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:08:58,570 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-08 11:08:58,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:08:58,624 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:08:58,630 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-08 11:08:58,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:08:58,657 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:08:58,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58 WrapperNode [2025-03-08 11:08:58,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:08:58,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:08:58,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:08:58,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:08:58,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,705 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-03-08 11:08:58,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:08:58,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:08:58,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:08:58,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:08:58,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,729 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 11:08:58,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:08:58,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:08:58,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:08:58,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:08:58,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (1/1) ... [2025-03-08 11:08:58,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:08:58,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:58,777 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 11:08:58,780 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 11:08:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:08:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:08:58,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:08:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:08:58,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:08:58,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:08:58,850 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:08:58,852 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:08:59,190 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 11:08:59,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:08:59,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:08:59,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:08:59,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:08:59 BoogieIcfgContainer [2025-03-08 11:08:59,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:08:59,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:08:59,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:08:59,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:08:59,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:08:58" (1/3) ... [2025-03-08 11:08:59,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b75540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:08:59, skipping insertion in model container [2025-03-08 11:08:59,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:08:58" (2/3) ... [2025-03-08 11:08:59,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b75540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:08:59, skipping insertion in model container [2025-03-08 11:08:59,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:08:59" (3/3) ... [2025-03-08 11:08:59,208 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-08 11:08:59,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:08:59,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:08:59,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:08:59,277 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;@3bc9351f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:08:59,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:08:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:08:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 11:08:59,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:59,293 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:59,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:59,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1812749528, now seen corresponding path program 1 times [2025-03-08 11:08:59,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:59,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-03-08 11:08:59,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:59,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:59,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 11:08:59,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 11:08:59,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:59,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 11:08:59,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:59,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-03-08 11:08:59,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552176574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:08:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322857756] [2025-03-08 11:08:59,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:08:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:08:59,575 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 11:08:59,577 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 11:08:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 11:08:59,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 11:08:59,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:59,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:59,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:08:59,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:08:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 11:08:59,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:08:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322857756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:08:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:08:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244457863] [2025-03-08 11:08:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:59,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:08:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:59,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:08:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:08:59,774 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:08:59,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:59,790 INFO L93 Difference]: Finished difference Result 138 states and 238 transitions. [2025-03-08 11:08:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:08:59,792 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-03-08 11:08:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:59,796 INFO L225 Difference]: With dead ends: 138 [2025-03-08 11:08:59,796 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 11:08:59,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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 11:08:59,800 INFO L435 NwaCegarLoop]: 104 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, 104 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 11:08:59,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:08:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 11:08:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 11:08:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:08:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-08 11:08:59,825 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2025-03-08 11:08:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:59,825 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-08 11:08:59,826 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:08:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-08 11:08:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:08:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:59,828 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:59,834 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 11:09:00,030 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 11:09:00,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:00,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1844224194, now seen corresponding path program 1 times [2025-03-08 11:09:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-03-08 11:09:00,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:00,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:00,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:00,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:00,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:09:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:09:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655082755] [2025-03-08 11:09:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655082755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:09:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979324002] [2025-03-08 11:09:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:00,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:09:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:09:00,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:09:00,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:09:00,280 INFO L87 Difference]: Start difference. First operand 69 states and 104 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:00,299 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2025-03-08 11:09:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:09:00,300 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-03-08 11:09:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:00,303 INFO L225 Difference]: With dead ends: 135 [2025-03-08 11:09:00,304 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 11:09:00,304 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 11:09:00,305 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:00,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:09:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 11:09:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 11:09:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:09:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2025-03-08 11:09:00,313 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 152 [2025-03-08 11:09:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:00,314 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2025-03-08 11:09:00,314 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2025-03-08 11:09:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:00,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:00,317 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:00,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:09:00,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:00,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -707932767, now seen corresponding path program 1 times [2025-03-08 11:09:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896118416] [2025-03-08 11:09:00,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:00,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:00,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:00,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:00,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:09:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:09:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896118416] [2025-03-08 11:09:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896118416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:09:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632959542] [2025-03-08 11:09:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:09:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:09:01,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:09:01,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:09:01,205 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:01,395 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2025-03-08 11:09:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:09:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-03-08 11:09:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:01,399 INFO L225 Difference]: With dead ends: 196 [2025-03-08 11:09:01,399 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 11:09:01,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:09:01,401 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 101 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:01,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 305 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:09:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 11:09:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2025-03-08 11:09:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 68 states have internal predecessors, (85), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:09:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2025-03-08 11:09:01,419 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 152 [2025-03-08 11:09:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:01,419 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2025-03-08 11:09:01,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2025-03-08 11:09:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:01,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:01,421 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:01,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:09:01,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:01,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash -707009246, now seen corresponding path program 1 times [2025-03-08 11:09:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:01,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335715328] [2025-03-08 11:09:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:01,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:01,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:01,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:09:01,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:09:01,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335715328] [2025-03-08 11:09:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335715328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:09:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175682624] [2025-03-08 11:09:01,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:01,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:09:01,696 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 11:09:01,697 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 11:09:01,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:01,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:01,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:01,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:01,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:09:01,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-08 11:09:01,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:09:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175682624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:09:02,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:09:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:09:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163838983] [2025-03-08 11:09:02,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:09:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:09:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:09:02,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:09:02,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:09:02,197 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-08 11:09:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:02,384 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2025-03-08 11:09:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:09:02,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 152 [2025-03-08 11:09:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:02,387 INFO L225 Difference]: With dead ends: 201 [2025-03-08 11:09:02,387 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 11:09:02,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:09:02,388 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 65 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:02,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:09:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 11:09:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2025-03-08 11:09:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 11:09:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2025-03-08 11:09:02,399 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 152 [2025-03-08 11:09:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2025-03-08 11:09:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-08 11:09:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2025-03-08 11:09:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:02,400 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:02,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:09:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 11:09:02,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1791006691, now seen corresponding path program 1 times [2025-03-08 11:09:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:09:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-03-08 11:09:02,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:09:02,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:02,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:02,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:02,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:09:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1407033061] [2025-03-08 11:09:02,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:02,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:09:02,684 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 11:09:02,686 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 11:09:02,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:02,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:02,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:02,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:09:02,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:09:02,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:02,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:02,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:02,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:09:02,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:09:02,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:09:02,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:09:02,947 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 11:09:03,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:09:03,143 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 11:09:03,216 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:09:03,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:09:03 BoogieIcfgContainer [2025-03-08 11:09:03,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:09:03,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:09:03,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:09:03,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:09:03,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:08:59" (3/4) ... [2025-03-08 11:09:03,220 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:09:03,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:09:03,221 INFO L158 Benchmark]: Toolchain (without parser) took 4760.07ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.2MB in the beginning and 176.9MB in the end (delta: -70.7MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2025-03-08 11:09:03,221 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:09:03,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.17ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 91.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:09:03,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.28ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:09:03,222 INFO L158 Benchmark]: Boogie Preprocessor took 40.78ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 80.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:09:03,222 INFO L158 Benchmark]: IcfgBuilder took 448.65ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 56.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 11:09:03,222 INFO L158 Benchmark]: TraceAbstraction took 4015.93ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 55.5MB in the beginning and 177.0MB in the end (delta: -121.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2025-03-08 11:09:03,222 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 285.2MB. Free memory was 177.0MB in the beginning and 176.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:09:03,223 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.17ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 91.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.28ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 88.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.78ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 80.5MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 448.65ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 56.7MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4015.93ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 55.5MB in the beginning and 177.0MB in the end (delta: -121.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 285.2MB. Free memory was 177.0MB in the beginning and 176.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] float var_1_31 = 127.75; [L42] float var_1_32 = 15.5; [L43] unsigned long int var_1_33 = 16; [L44] signed long int var_1_34 = 256; [L45] unsigned char var_1_35 = 0; [L46] signed short int var_1_36 = 8; [L47] signed long int var_1_37 = 256; [L48] unsigned long int var_1_38 = 500; [L49] unsigned char last_1_var_1_9 = 1; [L50] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L153] last_1_var_1_9 = var_1_9 [L154] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L116] var_1_4 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L117] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L118] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L119] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L134] var_1_28 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L137] var_1_29 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L140] var_1_32 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L142] var_1_35 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L145] var_1_36 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_36 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_36 >= -1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L148] var_1_37 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_37 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_37 >= -2147483647) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_37 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_37 <= 2147483646) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L55] COND TRUE -32 <= var_1_28 [L56] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L58] var_1_31 = var_1_32 [L59] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L60] COND TRUE var_1_31 > var_1_32 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L61] COND TRUE \read(var_1_35) [L62] var_1_34 = ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_34 < var_1_37 [L72] var_1_38 = ((((var_1_30 + var_1_29) < 0 ) ? -(var_1_30 + var_1_29) : (var_1_30 + var_1_29))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=1] [L76] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L83] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=1] [L85] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=1] [L86] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L89] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L90] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L93] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_25 = var_1_20 [L105] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L106] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L107] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L111] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 133 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 767 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 373 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 394 mSDtfsCounter, 202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1214 NumberOfCodeBlocks, 1214 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1055 ConstructedInterpolants, 0 QuantifiedInterpolants, 1810 SizeOfPredicates, 1 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6914/7084 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 11:09:03,238 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_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:09:04,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:09:05,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:09:05,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:09:05,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:09:05,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:09:05,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:09:05,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:09:05,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:09:05,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:09:05,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:09:05,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:09:05,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:09:05,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:09:05,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:09:05,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:09:05,099 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:09:05,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:09:05,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:09:05,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:09:05,100 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2025-03-08 11:09:05,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:09:05,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:09:05,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:09:05,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:09:05,314 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:09:05,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-08 11:09:06,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8adb784/6ba6a094e8bd46878ed72342c1861b84/FLAG2ac4ccc68 [2025-03-08 11:09:06,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:09:06,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-08 11:09:06,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8adb784/6ba6a094e8bd46878ed72342c1861b84/FLAG2ac4ccc68 [2025-03-08 11:09:07,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f8adb784/6ba6a094e8bd46878ed72342c1861b84 [2025-03-08 11:09:07,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:09:07,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:09:07,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:09:07,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:09:07,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:09:07,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07, skipping insertion in model container [2025-03-08 11:09:07,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:09:07,162 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-08 11:09:07,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:09:07,208 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:09:07,215 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-08 11:09:07,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:09:07,248 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:09:07,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07 WrapperNode [2025-03-08 11:09:07,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:09:07,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:09:07,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:09:07,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:09:07,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,280 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-03-08 11:09:07,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:09:07,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:09:07,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:09:07,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:09:07,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,304 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 11:09:07,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:09:07,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:09:07,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:09:07,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:09:07,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (1/1) ... [2025-03-08 11:09:07,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:09:07,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:09:07,345 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 11:09:07,349 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 11:09:07,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:09:07,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:09:07,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:09:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:09:07,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:09:07,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:09:07,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:09:07,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:09:07,957 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 11:09:07,957 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:09:07,968 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:09:07,968 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:09:07,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:07 BoogieIcfgContainer [2025-03-08 11:09:07,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:09:07,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:09:07,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:09:07,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:09:07,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:09:07" (1/3) ... [2025-03-08 11:09:07,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d74b657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:07, skipping insertion in model container [2025-03-08 11:09:07,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:07" (2/3) ... [2025-03-08 11:09:07,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d74b657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:07, skipping insertion in model container [2025-03-08 11:09:07,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:07" (3/3) ... [2025-03-08 11:09:07,976 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-08 11:09:07,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:09:07,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:09:08,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:09:08,028 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;@546b58a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:09:08,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:09:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:09:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 11:09:08,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:08,053 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:08,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:08,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1812749528, now seen corresponding path program 1 times [2025-03-08 11:09:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703862444] [2025-03-08 11:09:08,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:08,066 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 11:09:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:08,069 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 11:09:08,071 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 11:09:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 11:09:08,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 11:09:08,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:08,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:09:08,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-08 11:09:08,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:08,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:08,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703862444] [2025-03-08 11:09:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703862444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:08,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:09:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112223248] [2025-03-08 11:09:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:09:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:09:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:09:08,335 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:09:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:08,350 INFO L93 Difference]: Finished difference Result 138 states and 238 transitions. [2025-03-08 11:09:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:09:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-03-08 11:09:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:08,355 INFO L225 Difference]: With dead ends: 138 [2025-03-08 11:09:08,355 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 11:09:08,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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 11:09:08,358 INFO L435 NwaCegarLoop]: 104 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, 104 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 11:09:08,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:09:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 11:09:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 11:09:08,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 11:09:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-08 11:09:08,390 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2025-03-08 11:09:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:08,390 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-08 11:09:08,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 11:09:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-08 11:09:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:08,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:08,392 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:08,400 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 11:09:08,593 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 11:09:08,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:08,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1844224194, now seen corresponding path program 1 times [2025-03-08 11:09:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221573408] [2025-03-08 11:09:08,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:08,595 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 11:09:08,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:08,598 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 11:09:08,599 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 11:09:08,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:08,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:08,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:08,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:08,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:09:08,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:09:08,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:08,848 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:08,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221573408] [2025-03-08 11:09:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221573408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:08,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:08,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:09:08,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263958125] [2025-03-08 11:09:08,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:08,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:09:08,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:08,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:09:08,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:09:08,852 INFO L87 Difference]: Start difference. First operand 69 states and 104 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:08,917 INFO L93 Difference]: Finished difference Result 164 states and 248 transitions. [2025-03-08 11:09:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:09:08,918 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-03-08 11:09:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:08,921 INFO L225 Difference]: With dead ends: 164 [2025-03-08 11:09:08,922 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 11:09:08,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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 11:09:08,923 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 76 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:08,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 210 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:09:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 11:09:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-08 11:09:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 11:09:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2025-03-08 11:09:08,942 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 152 [2025-03-08 11:09:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:08,943 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2025-03-08 11:09:08,943 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2025-03-08 11:09:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:08,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:08,944 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:08,955 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 11:09:09,148 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 11:09:09,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash -741196061, now seen corresponding path program 1 times [2025-03-08 11:09:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595839933] [2025-03-08 11:09:09,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:09,150 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 11:09:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:09,152 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 11:09:09,153 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 11:09:09,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:09,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:09,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:09,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:09,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 11:09:09,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-08 11:09:09,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:09:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-08 11:09:09,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:09,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595839933] [2025-03-08 11:09:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595839933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:09:09,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:09:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 11:09:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585178517] [2025-03-08 11:09:09,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:09:09,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:09:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:09,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:09:09,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:09:09,686 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-08 11:09:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:10,009 INFO L93 Difference]: Finished difference Result 180 states and 256 transitions. [2025-03-08 11:09:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:09:10,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 152 [2025-03-08 11:09:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:10,020 INFO L225 Difference]: With dead ends: 180 [2025-03-08 11:09:10,020 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 11:09:10,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:09:10,021 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:10,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 151 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:09:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 11:09:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2025-03-08 11:09:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 60 states have internal predecessors, (67), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 11:09:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-03-08 11:09:10,034 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 152 [2025-03-08 11:09:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-03-08 11:09:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-08 11:09:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-03-08 11:09:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:10,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:10,035 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:10,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 11:09:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:10,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:10,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1756819876, now seen corresponding path program 1 times [2025-03-08 11:09:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351560497] [2025-03-08 11:09:10,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:10,237 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 11:09:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:10,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:09:10,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:09:10,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:10,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:10,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:10,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:10,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:09:10,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:09:10,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:10,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:10,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351560497] [2025-03-08 11:09:10,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351560497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:10,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:10,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:09:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223207754] [2025-03-08 11:09:10,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:10,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:09:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:10,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:09:10,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:09:10,419 INFO L87 Difference]: Start difference. First operand 103 states and 145 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:10,522 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2025-03-08 11:09:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:09:10,531 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-03-08 11:09:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:10,532 INFO L225 Difference]: With dead ends: 174 [2025-03-08 11:09:10,532 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 11:09:10,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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 11:09:10,533 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:10,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:09:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 11:09:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 11:09:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 11:09:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2025-03-08 11:09:10,550 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 152 [2025-03-08 11:09:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:10,552 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2025-03-08 11:09:10,552 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2025-03-08 11:09:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:10,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:10,553 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:10,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-08 11:09:10,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:10,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash -795337085, now seen corresponding path program 1 times [2025-03-08 11:09:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598636788] [2025-03-08 11:09:10,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:10,755 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 11:09:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:10,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:09:10,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 11:09:10,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:10,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 11:09:10,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:09:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-08 11:09:11,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:09:11,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:09:11,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598636788] [2025-03-08 11:09:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598636788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:09:11,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:09:11,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:09:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446494993] [2025-03-08 11:09:11,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:09:11,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:09:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:09:11,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:09:11,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:09:11,077 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:09:11,585 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2025-03-08 11:09:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:09:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-03-08 11:09:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:09:11,591 INFO L225 Difference]: With dead ends: 266 [2025-03-08 11:09:11,591 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 11:09:11,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:09:11,593 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 163 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:09:11,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 426 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:09:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 11:09:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 123. [2025-03-08 11:09:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 11:09:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2025-03-08 11:09:11,621 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 152 [2025-03-08 11:09:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:09:11,621 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2025-03-08 11:09:11,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-08 11:09:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2025-03-08 11:09:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 11:09:11,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:09:11,623 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:09:11,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 11:09:11,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:09:11,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:09:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:09:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -794413564, now seen corresponding path program 1 times [2025-03-08 11:09:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:09:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384349910] [2025-03-08 11:09:11,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:09:11,832 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 11:09:11,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:09:11,834 INFO L229 MonitoredProcess]: Starting monitored process 7 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 11:09:11,836 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 (7)] Waiting until timeout for monitored process [2025-03-08 11:09:11,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 11:09:12,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 11:09:12,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:09:12,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:09:12,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 11:09:12,026 INFO L279 TraceCheckSpWp]: Computing forward predicates...