./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.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 445ce6bdf080c92f954fc3281f13d2ff84d1c229e33576e3f3398bc314255b4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:39:56,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:39:56,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:39:56,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:39:56,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:39:56,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:39:56,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:39:56,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:39:56,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:39:56,482 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:39:56,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:39:56,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:39:56,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:39:56,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:39:56,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:39:56,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:39:56,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:39:56,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:39:56,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:39:56,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:39:56,485 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 -> 445ce6bdf080c92f954fc3281f13d2ff84d1c229e33576e3f3398bc314255b4f [2025-03-08 14:39:56,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:39:56,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:39:56,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:39:56,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:39:56,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:39:56,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i [2025-03-08 14:39:57,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4602bb08/3b6914637ec44e6a84263fee5e27284e/FLAGec3c0f658 [2025-03-08 14:39:58,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:39:58,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i [2025-03-08 14:39:58,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4602bb08/3b6914637ec44e6a84263fee5e27284e/FLAGec3c0f658 [2025-03-08 14:39:58,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4602bb08/3b6914637ec44e6a84263fee5e27284e [2025-03-08 14:39:58,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:39:58,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:39:58,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:39:58,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:39:58,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:39:58,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6181a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58, skipping insertion in model container [2025-03-08 14:39:58,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:39:58,560 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i[915,928] [2025-03-08 14:39:58,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:39:58,604 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:39:58,611 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i[915,928] [2025-03-08 14:39:58,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:39:58,648 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:39:58,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58 WrapperNode [2025-03-08 14:39:58,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:39:58,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:39:58,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:39:58,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:39:58,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,684 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-08 14:39:58,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:39:58,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:39:58,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:39:58,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:39:58,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,709 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:39:58,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:39:58,721 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:39:58,721 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:39:58,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:39:58,722 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (1/1) ... [2025-03-08 14:39:58,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:39:58,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:39:58,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:39:58,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:39:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:39:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:39:58,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:39:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:39:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:39:58,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:39:58,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:39:58,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:39:59,125 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:39:59,126 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:39:59,132 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:39:59,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:39:59,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:39:59 BoogieIcfgContainer [2025-03-08 14:39:59,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:39:59,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:39:59,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:39:59,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:39:59,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:39:58" (1/3) ... [2025-03-08 14:39:59,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3771c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:39:59, skipping insertion in model container [2025-03-08 14:39:59,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:39:58" (2/3) ... [2025-03-08 14:39:59,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3771c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:39:59, skipping insertion in model container [2025-03-08 14:39:59,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:39:59" (3/3) ... [2025-03-08 14:39:59,145 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-14.i [2025-03-08 14:39:59,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:39:59,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-14.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:39:59,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:39:59,214 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;@7c9e18ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:39:59,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:39:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 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 14:39:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:39:59,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:39:59,226 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] [2025-03-08 14:39:59,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:39:59,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:39:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1851238215, now seen corresponding path program 1 times [2025-03-08 14:39:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:39:59,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980955278] [2025-03-08 14:39:59,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:39:59,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:39:59,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:39:59,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:39:59,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:39:59,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:39:59,499 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 14:39:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:39:59,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980955278] [2025-03-08 14:39:59,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980955278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:39:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619358158] [2025-03-08 14:39:59,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:39:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:39:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:39:59,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:39:59,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:39:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:39:59,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:39:59,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:39:59,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:39:59,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:39:59,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:39:59,690 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 14:39:59,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:39:59,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619358158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:39:59,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:39:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:39:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687365971] [2025-03-08 14:39:59,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:39:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:39:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:39:59,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:39:59,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:39:59,714 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 14:39:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:39:59,730 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2025-03-08 14:39:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:39:59,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 143 [2025-03-08 14:39:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:39:59,736 INFO L225 Difference]: With dead ends: 125 [2025-03-08 14:39:59,736 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 14:39:59,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:39:59,740 INFO L435 NwaCegarLoop]: 96 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, 96 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:39:59,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:39:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 14:39:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 14:39:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 14:39:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-08 14:39:59,766 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 143 [2025-03-08 14:39:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:39:59,766 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-08 14:39:59,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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 14:39:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-08 14:39:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:39:59,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:39:59,769 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] [2025-03-08 14:39:59,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:39:59,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:39:59,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:39:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:39:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1449833996, now seen corresponding path program 1 times [2025-03-08 14:39:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:39:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228301720] [2025-03-08 14:39:59,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:39:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:39:59,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:40:00,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:40:00,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:00,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:40:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479914792] [2025-03-08 14:40:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:00,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:40:00,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:40:00,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:40:00,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:40:00,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:00,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 14:40:00,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:40:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 222 proven. 6 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-03-08 14:40:00,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:40:00,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:40:00,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228301720] [2025-03-08 14:40:00,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:40:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479914792] [2025-03-08 14:40:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479914792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:40:00,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:40:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-08 14:40:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155845881] [2025-03-08 14:40:00,887 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:40:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:40:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:40:00,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:40:00,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:40:00,889 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 14:40:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:40:01,239 INFO L93 Difference]: Finished difference Result 217 states and 329 transitions. [2025-03-08 14:40:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 14:40:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 14:40:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:40:01,242 INFO L225 Difference]: With dead ends: 217 [2025-03-08 14:40:01,242 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 14:40:01,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:40:01,243 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 123 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:40:01,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 277 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:40:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 14:40:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-03-08 14:40:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 83 states have internal predecessors, (102), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 14:40:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2025-03-08 14:40:01,264 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 143 [2025-03-08 14:40:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:40:01,266 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2025-03-08 14:40:01,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 14:40:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2025-03-08 14:40:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:40:01,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:01,268 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] [2025-03-08 14:40:01,276 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 14:40:01,469 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,SelfDestructingSolverStorable1 [2025-03-08 14:40:01,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:01,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 292976339, now seen corresponding path program 1 times [2025-03-08 14:40:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:40:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448821006] [2025-03-08 14:40:01,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:40:01,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:40:01,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:40:01,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:01,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:40:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112507474] [2025-03-08 14:40:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:01,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:01,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:40:01,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:40:01,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:40:01,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:40:01,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:01,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 14:40:01,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:40:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 396 proven. 15 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-08 14:40:02,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:40:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:40:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448821006] [2025-03-08 14:40:02,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:40:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112507474] [2025-03-08 14:40:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112507474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:40:02,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:40:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-08 14:40:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234879227] [2025-03-08 14:40:02,294 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:40:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:40:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:40:02,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:40:02,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:40:02,296 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 14:40:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:40:02,804 INFO L93 Difference]: Finished difference Result 291 states and 429 transitions. [2025-03-08 14:40:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 14:40:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-08 14:40:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:40:02,810 INFO L225 Difference]: With dead ends: 291 [2025-03-08 14:40:02,810 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 14:40:02,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 14:40:02,812 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 91 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 14:40:02,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 341 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 14:40:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 14:40:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2025-03-08 14:40:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 85 states have internal predecessors, (103), 61 states have call successors, (61), 5 states have call predecessors, (61), 5 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 14:40:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2025-03-08 14:40:02,829 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 143 [2025-03-08 14:40:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:40:02,829 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2025-03-08 14:40:02,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 14:40:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2025-03-08 14:40:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:40:02,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:02,831 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] [2025-03-08 14:40:02,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:40:03,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:03,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:03,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash -36174091, now seen corresponding path program 1 times [2025-03-08 14:40:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:40:03,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255860346] [2025-03-08 14:40:03,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:40:03,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:40:03,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:40:03,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:03,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:03,391 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 14:40:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:40:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255860346] [2025-03-08 14:40:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255860346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:40:03,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:40:03,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:40:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603174080] [2025-03-08 14:40:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:40:03,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:40:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:40:03,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:40:03,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:40:03,393 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 14:40:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:40:03,525 INFO L93 Difference]: Finished difference Result 421 states and 619 transitions. [2025-03-08 14:40:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:40:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 144 [2025-03-08 14:40:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:40:03,529 INFO L225 Difference]: With dead ends: 421 [2025-03-08 14:40:03,529 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 14:40:03,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:40:03,530 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:40:03,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:40:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 14:40:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 274. [2025-03-08 14:40:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 156 states have (on average 1.2243589743589745) internal successors, (191), 157 states have internal predecessors, (191), 107 states have call successors, (107), 10 states have call predecessors, (107), 10 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-08 14:40:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 405 transitions. [2025-03-08 14:40:03,578 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 405 transitions. Word has length 144 [2025-03-08 14:40:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:40:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 405 transitions. [2025-03-08 14:40:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 14:40:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 405 transitions. [2025-03-08 14:40:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 14:40:03,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:03,584 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] [2025-03-08 14:40:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:40:03,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1833125450, now seen corresponding path program 1 times [2025-03-08 14:40:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:40:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614930612] [2025-03-08 14:40:03,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:40:03,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:40:03,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:40:03,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:40:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522531151] [2025-03-08 14:40:03,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:03,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:03,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:03,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:40:03,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:40:03,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:40:03,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:40:03,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:03,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:40:03,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:40:03,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 14:40:03,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 14:40:03,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:03,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:40:03,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:40:03,866 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:40:03,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:40:03,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 14:40:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:40:04,071 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 14:40:04,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:40:04,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:40:04 BoogieIcfgContainer [2025-03-08 14:40:04,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:40:04,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:40:04,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:40:04,167 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:40:04,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:39:59" (3/4) ... [2025-03-08 14:40:04,169 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:40:04,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:40:04,170 INFO L158 Benchmark]: Toolchain (without parser) took 5733.45ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 51.4MB in the end (delta: 77.2MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2025-03-08 14:40:04,170 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:40:04,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.77ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 114.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:40:04,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.07ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 110.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:40:04,171 INFO L158 Benchmark]: Boogie Preprocessor took 35.17ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 105.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:40:04,172 INFO L158 Benchmark]: IcfgBuilder took 412.72ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 81.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:40:04,172 INFO L158 Benchmark]: TraceAbstraction took 5026.21ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 51.5MB in the end (delta: 29.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2025-03-08 14:40:04,172 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 167.8MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:40:04,173 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.81ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.77ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 114.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.07ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 110.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.17ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 105.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 412.72ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 81.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5026.21ms. Allocated memory is still 167.8MB. Free memory was 81.0MB in the beginning and 51.5MB in the end (delta: 29.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 167.8MB. Free memory was 51.5MB in the beginning and 51.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -10; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 0; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 1; [L28] unsigned long int var_1_11 = 16; [L29] signed short int var_1_12 = -32; [L30] unsigned char var_1_15 = 8; [L31] unsigned char var_1_17 = 100; [L32] unsigned char var_1_18 = 10; [L33] signed long int var_1_19 = 1; [L34] unsigned char var_1_20 = 5; [L35] float var_1_21 = 25.5; [L36] signed long int var_1_23 = -5; [L37] float var_1_24 = 1.125; [L38] float var_1_25 = 15.25; [L39] signed long int var_1_26 = 5; [L40] unsigned char var_1_28 = 16; [L41] unsigned char last_1_var_1_4 = 0; [L42] unsigned char last_1_var_1_15 = 8; [L43] signed long int last_1_var_1_19 = 1; [L44] float last_1_var_1_21 = 25.5; [L45] signed long int last_1_var_1_26 = 5; [L46] unsigned char last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L138] isInitial = 1 [L139] FCALL initially() [L140] int k_loop; [L141] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L141] COND TRUE k_loop < 1 [L142] CALL updateLastVariables() [L126] last_1_var_1_4 = var_1_4 [L127] last_1_var_1_15 = var_1_15 [L128] last_1_var_1_19 = var_1_19 [L129] last_1_var_1_21 = var_1_21 [L130] last_1_var_1_26 = var_1_26 [L131] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=1, var_1_8=0, var_1_9=0] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L90] var_1_7 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_8=0, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L93] var_1_8 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_9=0] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=0] [L96] var_1_9 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=-32, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L102] var_1_12 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L104] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=100, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L106] var_1_17 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L108] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=10, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L109] var_1_18 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L111] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=5, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L112] var_1_20 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_20 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L114] RET assume_abort_if_not(var_1_20 <= 255) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-5, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L116] var_1_23 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L117] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_24=9/8, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L120] var_1_24 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_25=61/4, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L122] var_1_25 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L123] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L143] RET updateVariables() [L144] CALL step() [L50] COND TRUE (last_1_var_1_28 / var_1_12) <= last_1_var_1_19 [L51] var_1_11 = ((((last_1_var_1_28) > (last_1_var_1_15)) ? (last_1_var_1_28) : (last_1_var_1_15))) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L53] COND TRUE ((((last_1_var_1_21) < (-0.5)) ? (last_1_var_1_21) : (-0.5))) > (10.9 * last_1_var_1_21) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=8, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L54] COND FALSE !(\read(last_1_var_1_4)) [L57] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-10, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=16, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L60] var_1_1 = (var_1_15 + var_1_15) [L61] var_1_28 = var_1_17 VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=5, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L62] COND TRUE var_1_9 || ((var_1_11 + last_1_var_1_26) <= 4) [L63] var_1_26 = (var_1_28 - var_1_20) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=51/2, var_1_23=-1, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L67] COND TRUE ((~ var_1_28) * var_1_1) >= (var_1_15 % var_1_23) [L68] var_1_21 = ((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L70] COND TRUE (var_1_21 + 9.999999999999994E14f) < (- var_1_21) [L71] var_1_4 = (var_1_7 && var_1_8) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L77] unsigned char stepLocal_1 = var_1_17; [L78] signed long int stepLocal_0 = var_1_15 % var_1_20; VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, stepLocal_0=0, stepLocal_1=1, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L79] COND FALSE !(stepLocal_0 != var_1_1) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, stepLocal_1=1, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L144] RET step() [L145] CALL, EXPR property() [L134-L135] return (((((((var_1_1 == ((signed long int) (var_1_15 + var_1_15))) && (((var_1_21 + 9.999999999999994E14f) < (- var_1_21)) ? (var_1_4 == ((unsigned char) (var_1_7 && var_1_8))) : (var_1_7 ? (var_1_4 == ((unsigned char) ((var_1_8 || var_1_9) && var_1_10))) : 1))) && (((last_1_var_1_28 / var_1_12) <= last_1_var_1_19) ? (var_1_11 == ((unsigned long int) ((((last_1_var_1_28) > (last_1_var_1_15)) ? (last_1_var_1_28) : (last_1_var_1_15))))) : 1)) && ((((((last_1_var_1_21) < (-0.5)) ? (last_1_var_1_21) : (-0.5))) > (10.9 * last_1_var_1_21)) ? (last_1_var_1_4 ? (var_1_15 == ((unsigned char) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) < (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_15 == ((unsigned char) var_1_18))) : 1)) && (((var_1_15 % var_1_20) != var_1_1) ? ((var_1_18 == var_1_17) ? (var_1_4 ? (var_1_19 == ((signed long int) var_1_18)) : (var_1_19 == ((signed long int) var_1_26))) : 1) : 1)) && ((((~ var_1_28) * var_1_1) >= (var_1_15 % var_1_23)) ? (var_1_21 == ((float) ((((var_1_24) > (var_1_25)) ? (var_1_24) : (var_1_25))))) : 1)) && ((var_1_9 || ((var_1_11 + last_1_var_1_26) <= 4)) ? (var_1_26 == ((signed long int) (var_1_28 - var_1_20))) : (var_1_26 == ((signed long int) (var_1_20 - var_1_17))))) && (var_1_28 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, last_1_var_1_19=1, last_1_var_1_21=51/2, last_1_var_1_26=5, last_1_var_1_28=16, last_1_var_1_4=0, var_1_10=1, var_1_11=16, var_1_12=9, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=1, var_1_21=2, var_1_23=-1, var_1_24=2, var_1_25=0, var_1_26=0, var_1_28=1, var_1_4=0, var_1_7=-255, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 121 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 284 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 609 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 664 IncrementalHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 375 mSDtfsCounter, 664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=4, InterpolantAutomatonStates: 34, 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, 49 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1290 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 711 ConstructedInterpolants, 1 QuantifiedInterpolants, 1973 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1039 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4995/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:40:04,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.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 445ce6bdf080c92f954fc3281f13d2ff84d1c229e33576e3f3398bc314255b4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:40:05,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:40:06,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:40:06,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:40:06,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:40:06,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:40:06,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:40:06,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:40:06,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:40:06,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:40:06,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:40:06,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:40:06,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:40:06,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:40:06,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:40:06,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:40:06,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:40:06,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:40:06,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:40:06,042 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 -> 445ce6bdf080c92f954fc3281f13d2ff84d1c229e33576e3f3398bc314255b4f [2025-03-08 14:40:06,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:40:06,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:40:06,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:40:06,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:40:06,275 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:40:06,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i [2025-03-08 14:40:07,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6494f49cc/0015307c882547099e62b1ba4f5307fd/FLAGc5ffc31b1 [2025-03-08 14:40:07,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:40:07,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i [2025-03-08 14:40:07,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6494f49cc/0015307c882547099e62b1ba4f5307fd/FLAGc5ffc31b1 [2025-03-08 14:40:08,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6494f49cc/0015307c882547099e62b1ba4f5307fd [2025-03-08 14:40:08,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:40:08,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:40:08,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:40:08,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:40:08,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:40:08,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2ed4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08, skipping insertion in model container [2025-03-08 14:40:08,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:40:08,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i[915,928] [2025-03-08 14:40:08,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:40:08,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:40:08,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-14.i[915,928] [2025-03-08 14:40:08,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:40:08,213 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:40:08,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08 WrapperNode [2025-03-08 14:40:08,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:40:08,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:40:08,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:40:08,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:40:08,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,251 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-08 14:40:08,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:40:08,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:40:08,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:40:08,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:40:08,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:40:08,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:40:08,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:40:08,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:40:08,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:40:08,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (1/1) ... [2025-03-08 14:40:08,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:40:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:40:08,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:40:08,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:40:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:40:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:40:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:40:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:40:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:40:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:40:08,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:40:08,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:40:15,173 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:40:15,174 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:40:15,184 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:40:15,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:40:15,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:40:15 BoogieIcfgContainer [2025-03-08 14:40:15,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:40:15,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:40:15,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:40:15,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:40:15,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:40:08" (1/3) ... [2025-03-08 14:40:15,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5595ca3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:40:15, skipping insertion in model container [2025-03-08 14:40:15,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:40:08" (2/3) ... [2025-03-08 14:40:15,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5595ca3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:40:15, skipping insertion in model container [2025-03-08 14:40:15,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:40:15" (3/3) ... [2025-03-08 14:40:15,192 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-14.i [2025-03-08 14:40:15,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:40:15,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-14.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:40:15,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:40:15,245 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;@4dd6bfc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:40:15,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:40:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 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 14:40:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:40:15,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:15,256 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] [2025-03-08 14:40:15,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1851238215, now seen corresponding path program 1 times [2025-03-08 14:40:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:40:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714224005] [2025-03-08 14:40:15,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:15,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:40:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:40:15,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:40:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:40:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:40:15,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:40:15,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:15,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:15,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:40:15,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:40:15,646 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 14:40:15,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:40:15,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:40:15,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714224005] [2025-03-08 14:40:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714224005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:40:15,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:40:15,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:40:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143291884] [2025-03-08 14:40:15,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:40:15,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:40:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:40:15,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:40:15,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:40:15,669 INFO L87 Difference]: Start difference. First operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 14:40:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:40:15,695 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2025-03-08 14:40:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:40:15,697 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 143 [2025-03-08 14:40:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:40:15,702 INFO L225 Difference]: With dead ends: 125 [2025-03-08 14:40:15,703 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 14:40:15,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:40:15,708 INFO L435 NwaCegarLoop]: 96 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, 96 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:40:15,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:40:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 14:40:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 14:40:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 14:40:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-03-08 14:40:15,749 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 143 [2025-03-08 14:40:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:40:15,749 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-03-08 14:40:15,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 14:40:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-03-08 14:40:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 14:40:15,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:40:15,753 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] [2025-03-08 14:40:15,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:40:15,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:40:15,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:40:15,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:40:15,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1449833996, now seen corresponding path program 1 times [2025-03-08 14:40:15,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:40:15,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591814874] [2025-03-08 14:40:15,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:40:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:40:15,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:40:15,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:40:15,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:40:16,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 14:40:16,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 14:40:16,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:40:16,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:40:16,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 14:40:16,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:40:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-08 14:40:31,340 INFO L312 TraceCheckSpWp]: Computing backward predicates...