./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:59:27,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:59:27,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:59:27,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:59:27,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:59:27,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:59:27,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:59:27,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:59:27,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:59:27,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:59:27,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:59:27,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:59:27,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:59:27,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:59:27,774 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:59:27,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:59:27,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:59:27,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:59:27,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:59:27,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:59:27,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:59:27,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:59:27,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:59:27,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:59:27,777 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2025-03-03 22:59:28,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:59:28,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:59:28,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:59:28,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:59:28,019 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:59:28,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2025-03-03 22:59:29,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132b18e85/17229e299fe041f1b599da1378be1bb8/FLAGe17c972d6 [2025-03-03 22:59:29,410 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:59:29,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2025-03-03 22:59:29,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132b18e85/17229e299fe041f1b599da1378be1bb8/FLAGe17c972d6 [2025-03-03 22:59:29,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/132b18e85/17229e299fe041f1b599da1378be1bb8 [2025-03-03 22:59:29,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:59:29,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:59:29,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:59:29,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:59:29,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:59:29,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:29,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516a0145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29, skipping insertion in model container [2025-03-03 22:59:29,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:29,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:59:29,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2025-03-03 22:59:29,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:59:29,916 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:59:29,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2025-03-03 22:59:29,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:59:29,980 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:59:29,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29 WrapperNode [2025-03-03 22:59:29,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:59:29,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:59:29,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:59:29,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:59:29,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:29,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,044 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2025-03-03 22:59:30,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:59:30,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:59:30,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:59:30,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:59:30,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,087 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-03 22:59:30,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:59:30,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:59:30,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:59:30,119 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:59:30,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (1/1) ... [2025-03-03 22:59:30,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:59:30,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:59:30,143 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-03 22:59:30,148 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-03 22:59:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:59:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:59:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:59:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:59:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:59:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:59:30,224 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:59:30,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:59:30,650 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2025-03-03 22:59:30,677 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 22:59:30,677 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:59:30,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:59:30,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:59:30,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:30 BoogieIcfgContainer [2025-03-03 22:59:30,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:59:30,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:59:30,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:59:30,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:59:30,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:59:29" (1/3) ... [2025-03-03 22:59:30,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13971e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:59:30, skipping insertion in model container [2025-03-03 22:59:30,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:59:29" (2/3) ... [2025-03-03 22:59:30,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13971e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:59:30, skipping insertion in model container [2025-03-03 22:59:30,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:30" (3/3) ... [2025-03-03 22:59:30,709 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2025-03-03 22:59:30,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:59:30,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-53.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:59:30,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:59:30,775 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;@4ce84276, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:59:30,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:59:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:59:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:59:30,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:30,790 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:30,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 826234802, now seen corresponding path program 1 times [2025-03-03 22:59:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593157165] [2025-03-03 22:59:30,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:30,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:30,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:59:30,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:59:30,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:30,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:59:31,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593157165] [2025-03-03 22:59:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593157165] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:59:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73729080] [2025-03-03 22:59:31,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:31,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:31,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:59:31,098 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-03 22:59:31,099 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-03 22:59:31,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:59:31,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:59:31,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:31,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:31,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:59:31,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:59:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 22:59:31,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:59:31,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73729080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:31,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:59:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:59:31,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010580133] [2025-03-03 22:59:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:59:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:31,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:59:31,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:59:31,305 INFO L87 Difference]: Start difference. First operand has 95 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 68 states have internal predecessors, (97), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:59:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:31,329 INFO L93 Difference]: Finished difference Result 184 states and 314 transitions. [2025-03-03 22:59:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:59:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2025-03-03 22:59:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:31,336 INFO L225 Difference]: With dead ends: 184 [2025-03-03 22:59:31,337 INFO L226 Difference]: Without dead ends: 92 [2025-03-03 22:59:31,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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-03 22:59:31,342 INFO L435 NwaCegarLoop]: 140 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, 140 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-03 22:59:31,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:59:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-03 22:59:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-03 22:59:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 22:59:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2025-03-03 22:59:31,396 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 170 [2025-03-03 22:59:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:31,397 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2025-03-03 22:59:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 22:59:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2025-03-03 22:59:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:59:31,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:31,399 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:31,406 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-03 22:59:31,600 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-03 22:59:31,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:31,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash 327489711, now seen corresponding path program 1 times [2025-03-03 22:59:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:31,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050223589] [2025-03-03 22:59:31,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:31,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:31,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:59:31,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:59:31,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:31,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050223589] [2025-03-03 22:59:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050223589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:32,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:59:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822174966] [2025-03-03 22:59:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:32,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:59:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:32,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:59:32,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:59:32,255 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:32,337 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2025-03-03 22:59:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:59:32,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:59:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:32,342 INFO L225 Difference]: With dead ends: 230 [2025-03-03 22:59:32,342 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 22:59:32,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 22:59:32,343 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 64 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:32,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 396 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:59:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 22:59:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-03 22:59:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 104 states have internal predecessors, (148), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 22:59:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2025-03-03 22:59:32,359 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 170 [2025-03-03 22:59:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:32,360 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2025-03-03 22:59:32,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2025-03-03 22:59:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 22:59:32,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:32,363 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:59:32,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:32,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1214993392, now seen corresponding path program 1 times [2025-03-03 22:59:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896517646] [2025-03-03 22:59:32,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:32,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 22:59:32,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 22:59:32,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:32,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896517646] [2025-03-03 22:59:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896517646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:34,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:34,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:59:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892383950] [2025-03-03 22:59:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:34,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:59:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:34,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:59:34,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:59:34,673 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:35,858 INFO L93 Difference]: Finished difference Result 542 states and 835 transitions. [2025-03-03 22:59:35,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 22:59:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2025-03-03 22:59:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:35,862 INFO L225 Difference]: With dead ends: 542 [2025-03-03 22:59:35,862 INFO L226 Difference]: Without dead ends: 408 [2025-03-03 22:59:35,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:59:35,864 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 289 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:35,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 807 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:59:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-03 22:59:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 240. [2025-03-03 22:59:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 22:59:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2025-03-03 22:59:35,898 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2025-03-03 22:59:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:35,898 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2025-03-03 22:59:35,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2025-03-03 22:59:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:59:35,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:35,900 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:35,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:59:35,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1903532335, now seen corresponding path program 1 times [2025-03-03 22:59:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235432726] [2025-03-03 22:59:35,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:35,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:35,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:59:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:59:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235432726] [2025-03-03 22:59:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235432726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:59:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072787820] [2025-03-03 22:59:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:37,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:59:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:59:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:59:37,494 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:38,109 INFO L93 Difference]: Finished difference Result 644 states and 994 transitions. [2025-03-03 22:59:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 22:59:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2025-03-03 22:59:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:38,112 INFO L225 Difference]: With dead ends: 644 [2025-03-03 22:59:38,112 INFO L226 Difference]: Without dead ends: 510 [2025-03-03 22:59:38,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:59:38,116 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 261 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:38,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 840 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:59:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-03 22:59:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 254. [2025-03-03 22:59:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 193 states have (on average 1.455958549222798) internal successors, (281), 194 states have internal predecessors, (281), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 22:59:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 393 transitions. [2025-03-03 22:59:38,148 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 393 transitions. Word has length 171 [2025-03-03 22:59:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:38,149 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 393 transitions. [2025-03-03 22:59:38,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 393 transitions. [2025-03-03 22:59:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:59:38,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:38,151 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:38,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:59:38,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:38,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:38,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1970539088, now seen corresponding path program 1 times [2025-03-03 22:59:38,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:38,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823754697] [2025-03-03 22:59:38,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:38,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:38,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:59:38,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:59:38,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:38,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:38,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:38,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823754697] [2025-03-03 22:59:38,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823754697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:38,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:38,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:59:38,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366685630] [2025-03-03 22:59:38,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:38,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:59:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:38,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:59:38,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:59:38,267 INFO L87 Difference]: Start difference. First operand 254 states and 393 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:38,370 INFO L93 Difference]: Finished difference Result 658 states and 1021 transitions. [2025-03-03 22:59:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:59:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2025-03-03 22:59:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:38,374 INFO L225 Difference]: With dead ends: 658 [2025-03-03 22:59:38,374 INFO L226 Difference]: Without dead ends: 478 [2025-03-03 22:59:38,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 22:59:38,377 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 138 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:38,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 427 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:59:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-03 22:59:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 367. [2025-03-03 22:59:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 295 states have (on average 1.4576271186440677) internal successors, (430), 298 states have internal predecessors, (430), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:59:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 558 transitions. [2025-03-03 22:59:38,399 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 558 transitions. Word has length 171 [2025-03-03 22:59:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 558 transitions. [2025-03-03 22:59:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 558 transitions. [2025-03-03 22:59:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 22:59:38,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:38,401 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:59:38,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:38,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1265905357, now seen corresponding path program 1 times [2025-03-03 22:59:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597542663] [2025-03-03 22:59:38,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:38,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 22:59:38,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 22:59:38,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:38,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:39,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:39,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597542663] [2025-03-03 22:59:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597542663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:39,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:39,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 22:59:39,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512630276] [2025-03-03 22:59:39,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:39,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 22:59:39,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:39,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 22:59:39,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:59:39,315 INFO L87 Difference]: Start difference. First operand 367 states and 558 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:39,970 INFO L93 Difference]: Finished difference Result 1097 states and 1680 transitions. [2025-03-03 22:59:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 22:59:39,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2025-03-03 22:59:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:39,976 INFO L225 Difference]: With dead ends: 1097 [2025-03-03 22:59:39,977 INFO L226 Difference]: Without dead ends: 840 [2025-03-03 22:59:39,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:59:39,978 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 245 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:39,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 760 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 22:59:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-03 22:59:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 369. [2025-03-03 22:59:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 297 states have (on average 1.4579124579124578) internal successors, (433), 300 states have internal predecessors, (433), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:59:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 561 transitions. [2025-03-03 22:59:40,007 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 561 transitions. Word has length 171 [2025-03-03 22:59:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:40,008 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 561 transitions. [2025-03-03 22:59:40,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 561 transitions. [2025-03-03 22:59:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:59:40,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:40,010 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:40,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:59:40,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:40,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1448854034, now seen corresponding path program 1 times [2025-03-03 22:59:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:40,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293490255] [2025-03-03 22:59:40,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:40,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:40,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:59:40,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:59:40,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:40,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:59:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293490255] [2025-03-03 22:59:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293490255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:59:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462210877] [2025-03-03 22:59:40,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:40,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:40,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:59:40,532 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-03 22:59:40,534 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-03 22:59:40,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:59:40,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:59:40,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:40,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:40,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 22:59:40,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:59:41,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-03-03 22:59:41,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:59:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 22:59:41,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462210877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:59:41,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:59:41,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2025-03-03 22:59:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816986292] [2025-03-03 22:59:41,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:59:41,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 22:59:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:41,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 22:59:41,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-03 22:59:41,681 INFO L87 Difference]: Start difference. First operand 369 states and 561 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-03-03 22:59:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:43,000 INFO L93 Difference]: Finished difference Result 1052 states and 1585 transitions. [2025-03-03 22:59:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 22:59:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 172 [2025-03-03 22:59:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:43,005 INFO L225 Difference]: With dead ends: 1052 [2025-03-03 22:59:43,006 INFO L226 Difference]: Without dead ends: 744 [2025-03-03 22:59:43,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 22:59:43,009 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 816 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:43,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1066 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:59:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-03 22:59:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 388. [2025-03-03 22:59:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 315 states have (on average 1.453968253968254) internal successors, (458), 318 states have internal predecessors, (458), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:59:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 586 transitions. [2025-03-03 22:59:43,043 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 586 transitions. Word has length 172 [2025-03-03 22:59:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:43,045 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 586 transitions. [2025-03-03 22:59:43,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-03-03 22:59:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 586 transitions. [2025-03-03 22:59:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:59:43,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:43,047 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:43,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:59:43,247 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,SelfDestructingSolverStorable6 [2025-03-03 22:59:43,247 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:43,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 975139890, now seen corresponding path program 1 times [2025-03-03 22:59:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029093314] [2025-03-03 22:59:43,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:43,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:59:43,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:59:43,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029093314] [2025-03-03 22:59:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029093314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:43,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:43,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:59:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595214922] [2025-03-03 22:59:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:43,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:59:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:43,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:59:43,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:59:43,387 INFO L87 Difference]: Start difference. First operand 388 states and 586 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:43,494 INFO L93 Difference]: Finished difference Result 704 states and 1071 transitions. [2025-03-03 22:59:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 22:59:43,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2025-03-03 22:59:43,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:43,498 INFO L225 Difference]: With dead ends: 704 [2025-03-03 22:59:43,498 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 22:59:43,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:59:43,499 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 60 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:43,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 372 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:59:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 22:59:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 392. [2025-03-03 22:59:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 319 states have (on average 1.4482758620689655) internal successors, (462), 322 states have internal predecessors, (462), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:59:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 590 transitions. [2025-03-03 22:59:43,527 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 590 transitions. Word has length 172 [2025-03-03 22:59:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:43,527 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 590 transitions. [2025-03-03 22:59:43,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 590 transitions. [2025-03-03 22:59:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 22:59:43,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:43,531 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:43,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 22:59:43,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash -325261420, now seen corresponding path program 1 times [2025-03-03 22:59:43,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:43,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105737509] [2025-03-03 22:59:43,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:43,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 22:59:43,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 22:59:43,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:43,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 22:59:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105737509] [2025-03-03 22:59:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105737509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 22:59:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889507962] [2025-03-03 22:59:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:44,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 22:59:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:44,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 22:59:44,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:59:44,474 INFO L87 Difference]: Start difference. First operand 392 states and 590 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:45,298 INFO L93 Difference]: Finished difference Result 1265 states and 1912 transitions. [2025-03-03 22:59:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:59:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2025-03-03 22:59:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:45,303 INFO L225 Difference]: With dead ends: 1265 [2025-03-03 22:59:45,304 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 22:59:45,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:59:45,305 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 340 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:45,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1183 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 22:59:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 22:59:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 390. [2025-03-03 22:59:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 317 states have (on average 1.4479495268138802) internal successors, (459), 320 states have internal predecessors, (459), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:59:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 587 transitions. [2025-03-03 22:59:45,330 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 587 transitions. Word has length 172 [2025-03-03 22:59:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:45,330 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 587 transitions. [2025-03-03 22:59:45,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 22:59:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 587 transitions. [2025-03-03 22:59:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 22:59:45,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:45,333 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:45,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 22:59:45,333 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash -464905073, now seen corresponding path program 1 times [2025-03-03 22:59:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:59:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590590359] [2025-03-03 22:59:45,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:59:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:59:46,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:59:46,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:59:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802742627] [2025-03-03 22:59:46,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:46,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:59:46,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:59:46,406 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-03 22:59:46,408 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-03 22:59:46,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 22:59:46,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 22:59:46,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:46,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:46,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 22:59:46,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:59:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 210 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-03-03 22:59:48,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:59:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 174 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2025-03-03 22:59:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:59:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590590359] [2025-03-03 22:59:51,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:59:51,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802742627] [2025-03-03 22:59:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802742627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:59:51,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:59:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 44 [2025-03-03 22:59:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253031489] [2025-03-03 22:59:51,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:59:51,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 22:59:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:59:51,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 22:59:51,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=1478, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 22:59:51,032 INFO L87 Difference]: Start difference. First operand 390 states and 587 transitions. Second operand has 44 states, 42 states have (on average 3.0) internal successors, (126), 40 states have internal predecessors, (126), 12 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (50), 10 states have call predecessors, (50), 12 states have call successors, (50) [2025-03-03 23:00:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:00:05,608 INFO L93 Difference]: Finished difference Result 2373 states and 3376 transitions. [2025-03-03 23:00:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-03 23:00:05,609 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 3.0) internal successors, (126), 40 states have internal predecessors, (126), 12 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (50), 10 states have call predecessors, (50), 12 states have call successors, (50) Word has length 173 [2025-03-03 23:00:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:00:05,618 INFO L225 Difference]: With dead ends: 2373 [2025-03-03 23:00:05,618 INFO L226 Difference]: Without dead ends: 2048 [2025-03-03 23:00:05,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9812 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=6100, Invalid=21622, Unknown=0, NotChecked=0, Total=27722 [2025-03-03 23:00:05,624 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 3289 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3292 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:00:05,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3292 Valid, 1625 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 23:00:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2025-03-03 23:00:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 822. [2025-03-03 23:00:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 700 states have (on average 1.4314285714285715) internal successors, (1002), 704 states have internal predecessors, (1002), 91 states have call successors, (91), 30 states have call predecessors, (91), 30 states have return successors, (91), 87 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 23:00:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1184 transitions. [2025-03-03 23:00:05,690 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1184 transitions. Word has length 173 [2025-03-03 23:00:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:00:05,690 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1184 transitions. [2025-03-03 23:00:05,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 3.0) internal successors, (126), 40 states have internal predecessors, (126), 12 states have call successors, (50), 7 states have call predecessors, (50), 13 states have return successors, (50), 10 states have call predecessors, (50), 12 states have call successors, (50) [2025-03-03 23:00:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1184 transitions. [2025-03-03 23:00:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 23:00:05,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:00:05,692 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:00:05,700 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-03 23:00:05,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:00:05,893 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:00:05,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:00:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1826094255, now seen corresponding path program 1 times [2025-03-03 23:00:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:00:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898363627] [2025-03-03 23:00:05,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:00:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:00:05,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 23:00:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 23:00:06,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:00:06,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:00:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934534940] [2025-03-03 23:00:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:00:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:00:06,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:00:06,019 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-03 23:00:06,021 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-03 23:00:06,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 23:00:06,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 23:00:06,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:00:06,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:00:06,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:00:06,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 23:00:06,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 23:00:06,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:00:06,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:00:06,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:00:06,299 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:00:06,299 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:00:06,312 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-03 23:00:06,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:00:06,506 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:00:06,616 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:00:06,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:00:06 BoogieIcfgContainer [2025-03-03 23:00:06,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:00:06,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:00:06,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:00:06,619 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:00:06,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:30" (3/4) ... [2025-03-03 23:00:06,621 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:00:06,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:00:06,622 INFO L158 Benchmark]: Toolchain (without parser) took 36878.25ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 112.3MB in the beginning and 366.3MB in the end (delta: -254.0MB). Peak memory consumption was 236.4MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,623 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:00:06,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.93ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 94.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.94ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 86.6MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,623 INFO L158 Benchmark]: Boogie Preprocessor took 71.92ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 71.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,624 INFO L158 Benchmark]: IcfgBuilder took 576.73ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 98.4MB in the end (delta: -27.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,624 INFO L158 Benchmark]: TraceAbstraction took 35916.04ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 97.6MB in the beginning and 366.4MB in the end (delta: -268.8MB). Peak memory consumption was 212.4MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,624 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 629.1MB. Free memory was 366.4MB in the beginning and 366.3MB in the end (delta: 84.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:00:06,625 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.93ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 94.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.94ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 86.6MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.92ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 71.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 576.73ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 98.4MB in the end (delta: -27.2MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35916.04ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 97.6MB in the beginning and 366.4MB in the end (delta: -268.8MB). Peak memory consumption was 212.4MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 629.1MB. Free memory was 366.4MB in the beginning and 366.3MB in the end (delta: 84.0kB). 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 167, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=52589, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L70] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=16, var_1_9=0] [L72] COND TRUE stepLocal_0 >= var_1_4 [L73] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L80] unsigned char stepLocal_3 = var_1_4; [L81] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L82] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L89] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=16, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L100] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L101] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L101] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L110] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L111] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L112] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L116] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L117] COND TRUE stepLocal_8 || var_1_14 [L118] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=254, var_1_29=639, var_1_2=127, var_1_30=32767, var_1_33=98303, var_1_34=32767, var_1_3=383, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 11, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5533 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5502 mSDsluCounter, 7616 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6153 mSDsCounter, 841 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6665 IncrementalHoareTripleChecker+Invalid, 7506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 841 mSolverCounterUnsat, 1463 mSDtfsCounter, 6665 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1122 GetRequests, 860 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10347 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=10, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 3159 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2573 NumberOfCodeBlocks, 2573 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 16866 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1251 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 16170/16800 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-03 23:00:06,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:00:08,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:00:08,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:00:08,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:00:08,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:00:08,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:00:08,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:00:08,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:00:08,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:00:08,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:00:08,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:00:08,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:00:08,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:00:08,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:00:08,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:00:08,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:00:08,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:00:08,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:00:08,606 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:00:08,607 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:00:08,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:00:08,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:00:08,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:00:08,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:00:08,607 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2025-03-03 23:00:08,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:00:08,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:00:08,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:00:08,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:00:08,910 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:00:08,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2025-03-03 23:00:10,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42558aa6/cd94d3f326f447de92c8fec32ecd36c5/FLAG7e4110d36 [2025-03-03 23:00:10,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:00:10,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2025-03-03 23:00:10,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42558aa6/cd94d3f326f447de92c8fec32ecd36c5/FLAG7e4110d36 [2025-03-03 23:00:10,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42558aa6/cd94d3f326f447de92c8fec32ecd36c5 [2025-03-03 23:00:10,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:00:10,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:00:10,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:00:10,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:00:10,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:00:10,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef33c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10, skipping insertion in model container [2025-03-03 23:00:10,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:00:10,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2025-03-03 23:00:10,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:00:10,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:00:10,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2025-03-03 23:00:10,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:00:10,655 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:00:10,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10 WrapperNode [2025-03-03 23:00:10,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:00:10,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:00:10,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:00:10,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:00:10,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,702 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-03 23:00:10,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:00:10,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:00:10,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:00:10,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:00:10,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,728 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-03 23:00:10,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:00:10,751 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:00:10,751 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:00:10,751 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:00:10,752 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (1/1) ... [2025-03-03 23:00:10,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:00:10,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:00:10,781 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-03 23:00:10,783 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-03 23:00:10,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:00:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:00:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:00:10,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:00:10,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:00:10,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:00:10,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:00:10,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:00:25,407 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 23:00:25,408 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:00:25,414 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:00:25,414 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:00:25,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:00:25 BoogieIcfgContainer [2025-03-03 23:00:25,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:00:25,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:00:25,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:00:25,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:00:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:00:10" (1/3) ... [2025-03-03 23:00:25,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4641b726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:00:25, skipping insertion in model container [2025-03-03 23:00:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:00:10" (2/3) ... [2025-03-03 23:00:25,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4641b726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:00:25, skipping insertion in model container [2025-03-03 23:00:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:00:25" (3/3) ... [2025-03-03 23:00:25,421 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2025-03-03 23:00:25,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:00:25,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-53.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:00:25,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:00:25,498 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;@7e308f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:00:25,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:00:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:00:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 23:00:25,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:00:25,510 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:00:25,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:00:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:00:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash 637910850, now seen corresponding path program 1 times [2025-03-03 23:00:25,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:00:25,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397407423] [2025-03-03 23:00:25,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:00:25,527 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-03 23:00:25,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:00:25,532 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-03 23:00:25,533 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-03 23:00:25,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 23:00:26,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 23:00:26,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:00:26,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:00:26,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:00:26,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:00:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 23:00:26,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:00:26,419 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:00:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397407423] [2025-03-03 23:00:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397407423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:00:26,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:00:26,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:00:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487440736] [2025-03-03 23:00:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:00:26,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:00:26,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:00:26,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:00:26,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:00:26,443 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:00:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:00:26,466 INFO L93 Difference]: Finished difference Result 162 states and 278 transitions. [2025-03-03 23:00:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:00:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2025-03-03 23:00:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:00:26,471 INFO L225 Difference]: With dead ends: 162 [2025-03-03 23:00:26,472 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 23:00:26,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-03 23:00:26,478 INFO L435 NwaCegarLoop]: 124 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, 124 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-03 23:00:26,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:00:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 23:00:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 23:00:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:00:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-03-03 23:00:26,518 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 167 [2025-03-03 23:00:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:00:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-03-03 23:00:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:00:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-03-03 23:00:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 23:00:26,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:00:26,524 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:00:26,543 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-03 23:00:26,724 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-03 23:00:26,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:00:26,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:00:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1419843739, now seen corresponding path program 1 times [2025-03-03 23:00:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:00:26,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434153891] [2025-03-03 23:00:26,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:00:26,726 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-03 23:00:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:00:26,728 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-03 23:00:26,730 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-03 23:00:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 23:00:27,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 23:00:27,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:00:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:00:27,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:00:27,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:00:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 514 proven. 51 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-03 23:00:32,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:00:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 23:00:36,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:00:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434153891] [2025-03-03 23:00:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434153891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:00:36,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:00:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 23:00:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356355620] [2025-03-03 23:00:36,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:00:36,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 23:00:36,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:00:36,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 23:00:36,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:00:36,252 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-03 23:00:44,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:00:48,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:00:52,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []