./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-49.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 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:51:31,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:51:32,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:51:32,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:51:32,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:51:32,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:51:32,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:51:32,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:51:32,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:51:32,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:51:32,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:51:32,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:51:32,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:51:32,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:51:32,068 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:51:32,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:51:32,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:51:32,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:51:32,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:51:32,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:51:32,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:51:32,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:51:32,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:51:32,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:51:32,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:51:32,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:51:32,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:51:32,072 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 -> 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 [2025-03-17 03:51:32,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:51:32,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:51:32,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:51:32,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:51:32,384 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:51:32,387 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-49.i [2025-03-17 03:51:33,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb27f948/d612788ca5a447a78553cfbb2f963bef/FLAGd44f8f358 [2025-03-17 03:51:33,945 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:51:33,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i [2025-03-17 03:51:33,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb27f948/d612788ca5a447a78553cfbb2f963bef/FLAGd44f8f358 [2025-03-17 03:51:34,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb27f948/d612788ca5a447a78553cfbb2f963bef [2025-03-17 03:51:34,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:51:34,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:51:34,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:51:34,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:51:34,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:51:34,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7b9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34, skipping insertion in model container [2025-03-17 03:51:34,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:51:34,357 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-49.i[915,928] [2025-03-17 03:51:34,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:51:34,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:51:34,431 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-49.i[915,928] [2025-03-17 03:51:34,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:51:34,462 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:51:34,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34 WrapperNode [2025-03-17 03:51:34,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:51:34,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:51:34,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:51:34,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:51:34,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,503 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-03-17 03:51:34,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:51:34,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:51:34,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:51:34,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:51:34,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,533 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-17 03:51:34,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:51:34,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:51:34,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:51:34,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:51:34,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (1/1) ... [2025-03-17 03:51:34,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:51:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:51:34,585 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-17 03:51:34,588 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-17 03:51:34,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:51:34,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:51:34,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:51:34,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:51:34,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:51:34,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:51:34,660 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:51:34,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:51:34,864 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-17 03:51:34,895 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:51:34,895 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:51:34,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:51:34,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:51:34,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:34 BoogieIcfgContainer [2025-03-17 03:51:34,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:51:34,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:51:34,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:51:34,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:51:34,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:51:34" (1/3) ... [2025-03-17 03:51:34,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5000fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:34, skipping insertion in model container [2025-03-17 03:51:34,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:34" (2/3) ... [2025-03-17 03:51:34,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e5000fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:34, skipping insertion in model container [2025-03-17 03:51:34,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:34" (3/3) ... [2025-03-17 03:51:34,919 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-49.i [2025-03-17 03:51:34,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:51:34,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-49.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:51:34,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:51:34,988 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;@2d8ee0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:51:34,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:51:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:51:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 03:51:35,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:35,003 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:35,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:35,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2099518452, now seen corresponding path program 1 times [2025-03-17 03:51:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:51:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779337995] [2025-03-17 03:51:35,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:35,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:51:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 03:51:35,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 03:51:35,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:51:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:51:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779337995] [2025-03-17 03:51:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779337995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:51:35,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870000647] [2025-03-17 03:51:35,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:51:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:51:35,303 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-17 03:51:35,325 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-17 03:51:35,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 03:51:35,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 03:51:35,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:35,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:35,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:51:35,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:51:35,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:51:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870000647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:51:35,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:51:35,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:51:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910912906] [2025-03-17 03:51:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:51:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:51:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:51:35,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:51:35,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:51:35,518 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:51:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:35,547 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2025-03-17 03:51:35,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:51:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-17 03:51:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:35,555 INFO L225 Difference]: With dead ends: 132 [2025-03-17 03:51:35,555 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 03:51:35,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-17 03:51:35,562 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:35,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:51:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 03:51:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 03:51:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:51:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2025-03-17 03:51:35,597 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 132 [2025-03-17 03:51:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:35,598 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2025-03-17 03:51:35,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:51:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2025-03-17 03:51:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 03:51:35,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:35,601 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:35,609 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-17 03:51:35,804 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-17 03:51:35,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:35,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:35,805 INFO L85 PathProgramCache]: Analyzing trace with hash -218417753, now seen corresponding path program 1 times [2025-03-17 03:51:35,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:51:35,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605575534] [2025-03-17 03:51:35,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:51:35,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 03:51:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 03:51:35,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:35,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:51:36,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:51:36,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605575534] [2025-03-17 03:51:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605575534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:51:36,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:51:36,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:51:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233152951] [2025-03-17 03:51:36,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:51:36,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:51:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:51:36,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:51:36,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:51:36,392 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:36,555 INFO L93 Difference]: Finished difference Result 200 states and 305 transitions. [2025-03-17 03:51:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:51:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-17 03:51:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:36,559 INFO L225 Difference]: With dead ends: 200 [2025-03-17 03:51:36,559 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 03:51:36,561 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-17 03:51:36,562 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 87 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:36,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 276 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:51:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 03:51:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2025-03-17 03:51:36,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 03:51:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2025-03-17 03:51:36,587 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 132 [2025-03-17 03:51:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:36,588 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2025-03-17 03:51:36,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2025-03-17 03:51:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 03:51:36,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:36,589 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:51:36,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:36,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash -120463765, now seen corresponding path program 1 times [2025-03-17 03:51:36,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:51:36,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980126737] [2025-03-17 03:51:36,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:51:36,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 03:51:36,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 03:51:36,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:36,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:51:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:51:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980126737] [2025-03-17 03:51:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980126737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:51:36,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:51:36,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:51:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403556738] [2025-03-17 03:51:36,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:51:36,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:51:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:51:36,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:51:36,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:51:36,847 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:36,874 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2025-03-17 03:51:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:51:36,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2025-03-17 03:51:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:36,877 INFO L225 Difference]: With dead ends: 169 [2025-03-17 03:51:36,878 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 03:51:36,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:51:36,879 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:36,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:51:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 03:51:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 03:51:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 60 states have internal predecessors, (74), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 03:51:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2025-03-17 03:51:36,895 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 133 [2025-03-17 03:51:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:36,896 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2025-03-17 03:51:36,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2025-03-17 03:51:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 03:51:36,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:36,899 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:36,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:51:36,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:36,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2146000553, now seen corresponding path program 1 times [2025-03-17 03:51:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:51:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485799722] [2025-03-17 03:51:36,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:51:36,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 03:51:36,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 03:51:36,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:36,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 03:51:37,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:51:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485799722] [2025-03-17 03:51:37,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485799722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:51:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590601508] [2025-03-17 03:51:37,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:51:37,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:51:37,228 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-17 03:51:37,245 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-17 03:51:37,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 03:51:37,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 03:51:37,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:37,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:37,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:51:37,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-17 03:51:37,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:51:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 03:51:37,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590601508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:51:37,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:51:37,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 03:51:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436595326] [2025-03-17 03:51:37,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:51:37,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:51:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:51:37,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:51:37,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:51:37,894 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-17 03:51:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:38,131 INFO L93 Difference]: Finished difference Result 182 states and 266 transitions. [2025-03-17 03:51:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:51:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 134 [2025-03-17 03:51:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:38,133 INFO L225 Difference]: With dead ends: 182 [2025-03-17 03:51:38,133 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 03:51:38,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:51:38,134 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 90 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:38,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 139 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:51:38,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 03:51:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2025-03-17 03:51:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 66 states have internal predecessors, (77), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 03:51:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-17 03:51:38,146 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 134 [2025-03-17 03:51:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:38,148 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-17 03:51:38,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) [2025-03-17 03:51:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-17 03:51:38,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 03:51:38,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:38,150 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:38,159 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-17 03:51:38,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 03:51:38,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:38,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1002636476, now seen corresponding path program 1 times [2025-03-17 03:51:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:51:38,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931562542] [2025-03-17 03:51:38,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:38,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:51:38,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 03:51:38,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 03:51:38,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:38,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 03:51:38,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:51:38,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931562542] [2025-03-17 03:51:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931562542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:51:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235683830] [2025-03-17 03:51:38,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:38,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:51:38,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:51:38,623 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-17 03:51:38,624 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-17 03:51:38,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 03:51:38,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 03:51:38,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:38,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:38,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:51:38,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-17 03:51:39,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:51:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 03:51:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235683830] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:51:40,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:51:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2025-03-17 03:51:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763453436] [2025-03-17 03:51:40,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:51:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 03:51:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:51:40,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 03:51:40,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:51:40,014 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-17 03:51:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:41,096 INFO L93 Difference]: Finished difference Result 479 states and 665 transitions. [2025-03-17 03:51:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 03:51:41,096 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) Word has length 134 [2025-03-17 03:51:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:41,099 INFO L225 Difference]: With dead ends: 479 [2025-03-17 03:51:41,099 INFO L226 Difference]: Without dead ends: 410 [2025-03-17 03:51:41,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=1190, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 03:51:41,102 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 431 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:41,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 595 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:51:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-17 03:51:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 325. [2025-03-17 03:51:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 208 states have (on average 1.2163461538461537) internal successors, (253), 208 states have internal predecessors, (253), 105 states have call successors, (105), 11 states have call predecessors, (105), 11 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-17 03:51:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 463 transitions. [2025-03-17 03:51:41,162 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 463 transitions. Word has length 134 [2025-03-17 03:51:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:41,163 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 463 transitions. [2025-03-17 03:51:41,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.176470588235294) internal successors, (88), 17 states have internal predecessors, (88), 6 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 6 states have call predecessors, (63), 6 states have call successors, (63) [2025-03-17 03:51:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 463 transitions. [2025-03-17 03:51:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 03:51:41,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:41,165 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:41,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 03:51:41,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:51:41,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1357923292, now seen corresponding path program 1 times [2025-03-17 03:51:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:51:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649360190] [2025-03-17 03:51:41,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:51:41,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 03:51:41,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 03:51:41,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:41,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:51:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289960251] [2025-03-17 03:51:41,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:41,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:51:41,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:51:41,456 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-17 03:51:41,464 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-17 03:51:41,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 03:51:41,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 03:51:41,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:41,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:51:41,753 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:51:41,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 03:51:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 03:51:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:51:41,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:51:41,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:51:41,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:51:41,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:51:42,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:51:42,057 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 03:51:42,127 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:51:42,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:51:42 BoogieIcfgContainer [2025-03-17 03:51:42,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:51:42,134 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:51:42,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:51:42,134 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:51:42,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:34" (3/4) ... [2025-03-17 03:51:42,136 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:51:42,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:51:42,138 INFO L158 Benchmark]: Toolchain (without parser) took 7912.01ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 112.0MB in the beginning and 76.9MB in the end (delta: 35.1MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2025-03-17 03:51:42,138 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:51:42,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.11ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:51:42,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.78ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 93.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:51:42,139 INFO L158 Benchmark]: Boogie Preprocessor took 49.47ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 89.0MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:51:42,139 INFO L158 Benchmark]: IcfgBuilder took 357.12ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 64.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 03:51:42,139 INFO L158 Benchmark]: TraceAbstraction took 7219.77ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 64.4MB in the beginning and 76.9MB in the end (delta: -12.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-17 03:51:42,139 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 192.9MB. Free memory was 76.9MB in the beginning and 76.9MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:51:42,140 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.68ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.11ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.4MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.78ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 93.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.47ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 89.0MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 357.12ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 64.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7219.77ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 64.4MB in the beginning and 76.9MB in the end (delta: -12.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 192.9MB. Free memory was 76.9MB in the beginning and 76.9MB in the end (delta: 33.1kB). Peak memory consumption was 8.4MB. 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 101, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of bitwiseAnd at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned long int var_1_3 = 3171453299; [L24] unsigned long int var_1_4 = 2038274679; [L25] unsigned long int var_1_5 = 1375699353; [L26] unsigned short int var_1_8 = 16; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 1; [L29] double var_1_14 = 64.45; [L30] float var_1_15 = 31.15; [L31] float var_1_16 = 16.4; [L32] double var_1_17 = 100.625; [L33] double var_1_18 = 128.1; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 8; [L36] unsigned char var_1_21 = 100; [L37] unsigned char var_1_22 = 0; [L38] signed char var_1_23 = 2; [L39] unsigned char var_1_24 = 0; [L40] unsigned long int last_1_var_1_1 = 10; [L41] unsigned short int last_1_var_1_8 = 16; [L42] unsigned char last_1_var_1_12 = 1; [L43] unsigned char last_1_var_1_19 = 1; [L44] unsigned char last_1_var_1_22 = 0; [L134] isInitial = 1 [L135] FCALL initially() [L136] int k_loop; [L137] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L137] COND TRUE k_loop < 1 [L138] CALL updateLastVariables() [L123] last_1_var_1_1 = var_1_1 [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_19 = var_1_19 [L127] last_1_var_1_22 = var_1_22 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L89] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L90] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_8=16] [L91] var_1_4 = __VERIFIER_nondet_ulong() [L92] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L92] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L93] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L93] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_8=16] [L94] var_1_5 = __VERIFIER_nondet_ulong() [L95] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L95] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L96] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L96] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L98] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L99] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L99] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L103] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L104] var_1_17 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L105] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L106] var_1_18 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L107] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L110] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L110] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L113] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L113] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L114] var_1_23 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L115] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L116] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L116] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L117] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L117] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L118] var_1_24 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L119] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L120] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L120] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L139] RET updateVariables() [L140] CALL step() [L48] COND TRUE ! last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L49] COND TRUE (last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19 [L50] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L55] COND FALSE !(var_1_13 && last_1_var_1_22) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=16] [L62] var_1_8 = ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19))))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L63] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L64] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L66] COND TRUE \read(last_1_var_1_12) [L67] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L69] EXPR var_1_19 & var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L69] COND FALSE !((-2 / var_1_23) >= (var_1_19 & var_1_4)) [L84] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L140] RET step() [L141] CALL, EXPR property() [L130] EXPR (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L130-L131] return (((((last_1_var_1_12 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((last_1_var_1_19) > (last_1_var_1_8)) ? (last_1_var_1_19) : (last_1_var_1_8))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))) ? (25) : ((((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) + (100 + var_1_19)))))))) && ((! last_1_var_1_22) ? (((last_1_var_1_1 * ((((last_1_var_1_19) < (var_1_5)) ? (last_1_var_1_19) : (var_1_5)))) >= last_1_var_1_19) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && last_1_var_1_22) ? ((var_1_4 > (256u * last_1_var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_19 & var_1_4)) ? ((var_1_21 >= (var_1_1 + var_1_5)) ? (((~ var_1_19) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_19=1, last_1_var_1_1=10, last_1_var_1_22=0, last_1_var_1_8=16, var_1_12=1, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=-6442451217, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=-3221225472, var_1_8=102] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 125 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 1290 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 869 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 886 IncrementalHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 421 mSDtfsCounter, 886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 720 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 122 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1335 NumberOfCodeBlocks, 1335 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 4605 SizeOfPredicates, 6 NumberOfNonLiveVariables, 959 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 8036/8400 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-17 03:51:42,161 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-49.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 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:51:44,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:51:44,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:51:44,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:51:44,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:51:44,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:51:44,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:51:44,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:51:44,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:51:44,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:51:44,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:51:44,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:51:44,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:51:44,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:51:44,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:51:44,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:51:44,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:51:44,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:51:44,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:51:44,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:51:44,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:51:44,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:51:44,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:51:44,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:51:44,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:51:44,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:51:44,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:51:44,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:51:44,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:51:44,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:51:44,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:51:44,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:51:44,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:51:44,461 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:51:44,461 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:51:44,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:51:44,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:51:44,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:51:44,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:51:44,462 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 -> 936aab998361efc45420d018b56df92fbb34844c50d535dc774b38d94c427472 [2025-03-17 03:51:44,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:51:44,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:51:44,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:51:44,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:51:44,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:51:44,798 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-49.i [2025-03-17 03:51:46,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b38d9c1/24ead13f4df149e696a5f77a82efac97/FLAGd10e8091f [2025-03-17 03:51:46,387 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:51:46,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-49.i [2025-03-17 03:51:46,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b38d9c1/24ead13f4df149e696a5f77a82efac97/FLAGd10e8091f [2025-03-17 03:51:46,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b38d9c1/24ead13f4df149e696a5f77a82efac97 [2025-03-17 03:51:46,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:51:46,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:51:46,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:51:46,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:51:46,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:51:46,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d4c8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46, skipping insertion in model container [2025-03-17 03:51:46,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:51:46,556 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-49.i[915,928] [2025-03-17 03:51:46,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:51:46,633 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:51:46,642 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-49.i[915,928] [2025-03-17 03:51:46,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:51:46,696 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:51:46,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46 WrapperNode [2025-03-17 03:51:46,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:51:46,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:51:46,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:51:46,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:51:46,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,744 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2025-03-17 03:51:46,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:51:46,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:51:46,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:51:46,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:51:46,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,775 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-17 03:51:46,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:51:46,803 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:51:46,803 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:51:46,803 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:51:46,804 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (1/1) ... [2025-03-17 03:51:46,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:51:46,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:51:46,838 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-17 03:51:46,840 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-17 03:51:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:51:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:51:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:51:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:51:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:51:46,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:51:46,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:51:46,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:51:47,384 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:51:47,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:51:47,395 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:51:47,395 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:51:47,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:47 BoogieIcfgContainer [2025-03-17 03:51:47,396 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:51:47,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:51:47,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:51:47,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:51:47,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:51:46" (1/3) ... [2025-03-17 03:51:47,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaaf626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:47, skipping insertion in model container [2025-03-17 03:51:47,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46" (2/3) ... [2025-03-17 03:51:47,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaaf626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:47, skipping insertion in model container [2025-03-17 03:51:47,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:47" (3/3) ... [2025-03-17 03:51:47,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-49.i [2025-03-17 03:51:47,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:51:47,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-49.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:51:47,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:51:47,474 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;@2f9873c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:51:47,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:51:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:51:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 03:51:47,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:47,488 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:47,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:47,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 912414635, now seen corresponding path program 1 times [2025-03-17 03:51:47,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:51:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983199164] [2025-03-17 03:51:47,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:47,505 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-17 03:51:47,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:51:47,510 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-17 03:51:47,512 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-17 03:51:47,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 03:51:47,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 03:51:47,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:47,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:47,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:51:47,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-17 03:51:47,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:51:47,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:51:47,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983199164] [2025-03-17 03:51:47,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983199164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:51:47,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:51:47,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:51:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131855960] [2025-03-17 03:51:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:51:47,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:51:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:51:47,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:51:47,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:51:47,854 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:51:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:47,875 INFO L93 Difference]: Finished difference Result 112 states and 196 transitions. [2025-03-17 03:51:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:51:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2025-03-17 03:51:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:47,881 INFO L225 Difference]: With dead ends: 112 [2025-03-17 03:51:47,881 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 03:51:47,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-17 03:51:47,887 INFO L435 NwaCegarLoop]: 84 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, 84 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-17 03:51:47,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:51:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 03:51:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 03:51:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 03:51:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2025-03-17 03:51:47,930 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 128 [2025-03-17 03:51:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:47,930 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2025-03-17 03:51:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-17 03:51:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2025-03-17 03:51:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 03:51:47,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:47,934 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:47,942 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-17 03:51:48,135 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-17 03:51:48,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 503885510, now seen corresponding path program 1 times [2025-03-17 03:51:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:51:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080080050] [2025-03-17 03:51:48,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:48,136 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-17 03:51:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:51:48,139 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-17 03:51:48,140 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-17 03:51:48,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 03:51:48,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 03:51:48,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:48,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:48,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 03:51:48,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:51:48,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:51:48,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:51:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080080050] [2025-03-17 03:51:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080080050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:51:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:51:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:51:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939721020] [2025-03-17 03:51:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:51:48,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:51:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:51:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:51:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:51:48,755 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:49,107 INFO L93 Difference]: Finished difference Result 167 states and 255 transitions. [2025-03-17 03:51:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:51:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2025-03-17 03:51:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:49,116 INFO L225 Difference]: With dead ends: 167 [2025-03-17 03:51:49,116 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 03:51:49,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 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-17 03:51:49,117 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:49,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 234 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:51:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 03:51:49,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2025-03-17 03:51:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 03:51:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2025-03-17 03:51:49,132 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 128 [2025-03-17 03:51:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:49,133 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2025-03-17 03:51:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2025-03-17 03:51:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 03:51:49,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:49,134 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:49,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:51:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:51:49,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:49,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash 919505271, now seen corresponding path program 1 times [2025-03-17 03:51:49,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:51:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263958125] [2025-03-17 03:51:49,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:49,336 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-17 03:51:49,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:51:49,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:51:49,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:51:49,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 03:51:49,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 03:51:49,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:49,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:49,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 03:51:49,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:51:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-17 03:51:49,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:51:49,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:51:49,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263958125] [2025-03-17 03:51:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263958125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:51:49,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:51:49,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:51:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297164689] [2025-03-17 03:51:49,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:51:49,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:51:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:51:49,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:51:49,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:51:49,838 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:51:50,148 INFO L93 Difference]: Finished difference Result 215 states and 323 transitions. [2025-03-17 03:51:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:51:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 129 [2025-03-17 03:51:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:51:50,150 INFO L225 Difference]: With dead ends: 215 [2025-03-17 03:51:50,151 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 03:51:50,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-17 03:51:50,152 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:51:50,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 252 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:51:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 03:51:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 150. [2025-03-17 03:51:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 03:51:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2025-03-17 03:51:50,197 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 129 [2025-03-17 03:51:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:51:50,198 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2025-03-17 03:51:50,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-17 03:51:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2025-03-17 03:51:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 03:51:50,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:51:50,200 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:51:50,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:51:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:51:50,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:51:50,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:51:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 918581750, now seen corresponding path program 1 times [2025-03-17 03:51:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:51:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819109740] [2025-03-17 03:51:50,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:51:50,402 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-17 03:51:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:51:50,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:51:50,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:51:50,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 03:51:50,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 03:51:50,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:51:50,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:51:50,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 03:51:50,607 INFO L279 TraceCheckSpWp]: Computing forward predicates...