./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.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_codestructure_steplocals_file-35.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 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:00:52,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:00:53,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:00:53,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:00:53,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:00:53,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:00:53,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:00:53,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:00:53,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:00:53,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:00:53,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:00:53,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:00:53,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:00:53,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:00:53,054 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:00:53,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:00:53,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:00:53,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:00:53,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:00:53,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:00:53,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:00:53,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:00:53,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:00:53,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:00:53,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:00:53,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:00:53,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:00:53,057 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 -> 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba [2025-03-03 19:00:53,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:00:53,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:00:53,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:00:53,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:00:53,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:00:53,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2025-03-03 19:00:54,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6c5731b/ee95b4d68ced4ce1b0a19f6280ab65da/FLAGfd69549bb [2025-03-03 19:00:54,685 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:00:54,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2025-03-03 19:00:54,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6c5731b/ee95b4d68ced4ce1b0a19f6280ab65da/FLAGfd69549bb [2025-03-03 19:00:55,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f6c5731b/ee95b4d68ced4ce1b0a19f6280ab65da [2025-03-03 19:00:55,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:00:55,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:00:55,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:00:55,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:00:55,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:00:55,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd8bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55, skipping insertion in model container [2025-03-03 19:00:55,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:00:55,141 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_codestructure_steplocals_file-35.i[917,930] [2025-03-03 19:00:55,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:00:55,208 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:00:55,217 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_codestructure_steplocals_file-35.i[917,930] [2025-03-03 19:00:55,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:00:55,259 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:00:55,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55 WrapperNode [2025-03-03 19:00:55,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:00:55,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:00:55,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:00:55,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:00:55,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,307 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 19:00:55,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:00:55,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:00:55,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:00:55,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:00:55,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,335 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 19:00:55,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:00:55,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:00:55,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:00:55,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:00:55,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (1/1) ... [2025-03-03 19:00:55,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:00:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:00:55,376 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 19:00:55,377 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 19:00:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:00:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:00:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:00:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:00:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:00:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:00:55,455 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:00:55,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:00:55,675 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 19:00:55,701 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:00:55,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:00:55,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:00:55,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:00:55,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:00:55 BoogieIcfgContainer [2025-03-03 19:00:55,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:00:55,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:00:55,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:00:55,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:00:55,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:00:55" (1/3) ... [2025-03-03 19:00:55,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282b2073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:00:55, skipping insertion in model container [2025-03-03 19:00:55,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:00:55" (2/3) ... [2025-03-03 19:00:55,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282b2073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:00:55, skipping insertion in model container [2025-03-03 19:00:55,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:00:55" (3/3) ... [2025-03-03 19:00:55,720 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-35.i [2025-03-03 19:00:55,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:00:55,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-35.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:00:55,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:00:55,787 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;@21b03aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:00:55,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:00:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:00:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:00:55,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:00:55,800 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:00:55,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:00:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:00:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1698687698, now seen corresponding path program 1 times [2025-03-03 19:00:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:00:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-03 19:00:55,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:00:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:00:55,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:00:55,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:00:55,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:00:55,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:00:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:00:56,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:00:56,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-03 19:00:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44848064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:00:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924242572] [2025-03-03 19:00:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:00:56,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:00:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:00:56,060 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 19:00:56,062 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 19:00:56,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:00:56,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:00:56,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:00:56,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:00:56,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:00:56,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:00:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 19:00:56,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:00:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924242572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:00:56,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:00:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:00:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821752938] [2025-03-03 19:00:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:00:56,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:00:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:00:56,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:00:56,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:00:56,256 INFO L87 Difference]: Start difference. First operand has 82 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 53 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:00:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:00:56,281 INFO L93 Difference]: Finished difference Result 158 states and 266 transitions. [2025-03-03 19:00:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:00:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-03 19:00:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:00:56,288 INFO L225 Difference]: With dead ends: 158 [2025-03-03 19:00:56,288 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 19:00:56,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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 19:00:56,294 INFO L435 NwaCegarLoop]: 115 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, 115 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 19:00:56,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:00:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 19:00:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 19:00:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:00:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2025-03-03 19:00:56,326 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 175 [2025-03-03 19:00:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:00:56,327 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2025-03-03 19:00:56,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:00:56,327 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2025-03-03 19:00:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:00:56,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:00:56,329 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:00:56,335 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 19:00:56,531 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 19:00:56,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:00:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:00:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1431966187, now seen corresponding path program 1 times [2025-03-03 19:00:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:00:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-03 19:00:56,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:00:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:00:56,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:00:56,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:00:56,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:00:56,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:00:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:00:56,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:00:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38001881] [2025-03-03 19:00:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38001881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:00:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:00:56,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:00:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012755967] [2025-03-03 19:00:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:00:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:00:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:00:56,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:00:56,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:00:56,920 INFO L87 Difference]: Start difference. First operand 79 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:00:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:00:57,066 INFO L93 Difference]: Finished difference Result 205 states and 303 transitions. [2025-03-03 19:00:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:00:57,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 19:00:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:00:57,068 INFO L225 Difference]: With dead ends: 205 [2025-03-03 19:00:57,068 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 19:00:57,069 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 19:00:57,069 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 72 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:00:57,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 256 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:00:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 19:00:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2025-03-03 19:00:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 83 states have internal predecessors, (104), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:00:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 186 transitions. [2025-03-03 19:00:57,091 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 186 transitions. Word has length 175 [2025-03-03 19:00:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:00:57,091 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 186 transitions. [2025-03-03 19:00:57,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:00:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 186 transitions. [2025-03-03 19:00:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:00:57,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:00:57,093 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:00:57,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:00:57,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:00:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:00:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1937524812, now seen corresponding path program 1 times [2025-03-03 19:00:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:00:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-03-03 19:00:57,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:00:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:00:57,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:00:57,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:00:57,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:00:57,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:00:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 12 proven. 204 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2025-03-03 19:00:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:00:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-03-03 19:00:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514555879] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:00:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288594647] [2025-03-03 19:00:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:00:59,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:00:59,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:00:59,092 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 19:00:59,093 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 19:00:59,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:00:59,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:00:59,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:00:59,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:00:59,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 19:00:59,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:01:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:00,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:01:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288594647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:01:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-03-03 19:01:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163686601] [2025-03-03 19:01:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:01:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:00,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:01:00,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:01:00,070 INFO L87 Difference]: Start difference. First operand 126 states and 186 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:00,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:00,378 INFO L93 Difference]: Finished difference Result 341 states and 495 transitions. [2025-03-03 19:01:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:01:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 19:01:00,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:00,383 INFO L225 Difference]: With dead ends: 341 [2025-03-03 19:01:00,384 INFO L226 Difference]: Without dead ends: 218 [2025-03-03 19:01:00,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:01:00,387 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 118 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:00,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 509 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:01:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-03 19:01:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 140. [2025-03-03 19:01:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 97 states have internal predecessors, (124), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:01:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-03 19:01:00,406 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 175 [2025-03-03 19:01:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:00,407 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-03 19:01:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-03 19:01:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:01:00,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:00,412 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:00,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:01:00,612 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,SelfDestructingSolverStorable2 [2025-03-03 19:01:00,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:00,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:00,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1360370131, now seen corresponding path program 1 times [2025-03-03 19:01:00,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:00,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633287323] [2025-03-03 19:01:00,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:00,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:01:00,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:01:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-03-03 19:01:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:01:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633287323] [2025-03-03 19:01:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633287323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:01:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209851165] [2025-03-03 19:01:02,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:01:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:01:02,011 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 19:01:02,013 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 19:01:02,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:01:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:01:02,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:02,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:02,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 19:01:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:01:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 940 proven. 162 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-03 19:01:03,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:01:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:05,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209851165] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 19:01:05,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:01:05,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 22] total 37 [2025-03-03 19:01:05,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169303329] [2025-03-03 19:01:05,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:05,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:01:05,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:05,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:01:05,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1073, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 19:01:05,492 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:06,620 INFO L93 Difference]: Finished difference Result 386 states and 556 transitions. [2025-03-03 19:01:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:01:06,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 19:01:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:06,622 INFO L225 Difference]: With dead ends: 386 [2025-03-03 19:01:06,622 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 19:01:06,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 326 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=338, Invalid=1468, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 19:01:06,625 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 264 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:06,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 609 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:01:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 19:01:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 146. [2025-03-03 19:01:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.303921568627451) internal successors, (133), 103 states have internal predecessors, (133), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:01:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 215 transitions. [2025-03-03 19:01:06,646 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 215 transitions. Word has length 175 [2025-03-03 19:01:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:06,647 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 215 transitions. [2025-03-03 19:01:06,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 215 transitions. [2025-03-03 19:01:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:01:06,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:06,651 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:06,657 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 19:01:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:01:06,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1163856626, now seen corresponding path program 1 times [2025-03-03 19:01:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114052772] [2025-03-03 19:01:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:06,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:01:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:01:06,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:06,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 21 proven. 129 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2025-03-03 19:01:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:01:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114052772] [2025-03-03 19:01:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114052772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:01:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770822907] [2025-03-03 19:01:07,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:01:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:01:07,893 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 19:01:07,895 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 19:01:07,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:01:08,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:01:08,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:08,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:08,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 19:01:08,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:01:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 518 proven. 60 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2025-03-03 19:01:09,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:01:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770822907] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 19:01:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:01:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10, 14] total 32 [2025-03-03 19:01:10,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056452047] [2025-03-03 19:01:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:01:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:01:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-03-03 19:01:10,621 INFO L87 Difference]: Start difference. First operand 146 states and 215 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:11,670 INFO L93 Difference]: Finished difference Result 503 states and 721 transitions. [2025-03-03 19:01:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:01:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 19:01:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:11,675 INFO L225 Difference]: With dead ends: 503 [2025-03-03 19:01:11,675 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 19:01:11,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=270, Invalid=1290, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 19:01:11,676 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 274 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:11,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 747 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:01:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 19:01:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 160. [2025-03-03 19:01:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 117 states have internal predecessors, (155), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:01:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 237 transitions. [2025-03-03 19:01:11,696 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 237 transitions. Word has length 175 [2025-03-03 19:01:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:11,696 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 237 transitions. [2025-03-03 19:01:11,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 237 transitions. [2025-03-03 19:01:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:01:11,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:11,698 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:11,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 19:01:11,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:01:11,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1388300335, now seen corresponding path program 1 times [2025-03-03 19:01:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556419799] [2025-03-03 19:01:11,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:11,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:01:11,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:01:11,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:11,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:13,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:01:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556419799] [2025-03-03 19:01:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556419799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:13,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:01:13,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:01:13,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865931977] [2025-03-03 19:01:13,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:13,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:01:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:13,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:01:13,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:01:13,493 INFO L87 Difference]: Start difference. First operand 160 states and 237 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:01:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:14,251 INFO L93 Difference]: Finished difference Result 574 states and 839 transitions. [2025-03-03 19:01:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:01:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-03 19:01:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:14,253 INFO L225 Difference]: With dead ends: 574 [2025-03-03 19:01:14,253 INFO L226 Difference]: Without dead ends: 417 [2025-03-03 19:01:14,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2025-03-03 19:01:14,254 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 244 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:14,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 541 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:01:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-03 19:01:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 318. [2025-03-03 19:01:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 231 states have (on average 1.3463203463203464) internal successors, (311), 233 states have internal predecessors, (311), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 19:01:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 475 transitions. [2025-03-03 19:01:14,286 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 475 transitions. Word has length 175 [2025-03-03 19:01:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:14,287 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 475 transitions. [2025-03-03 19:01:14,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:01:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 475 transitions. [2025-03-03 19:01:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:01:14,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:14,288 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:14,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:01:14,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:14,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2121008813, now seen corresponding path program 1 times [2025-03-03 19:01:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67674797] [2025-03-03 19:01:14,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:14,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:01:14,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:01:14,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:14,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:15,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:01:15,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67674797] [2025-03-03 19:01:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67674797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:01:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:01:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196774975] [2025-03-03 19:01:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:01:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:15,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:01:15,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:01:15,209 INFO L87 Difference]: Start difference. First operand 318 states and 475 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:15,939 INFO L93 Difference]: Finished difference Result 750 states and 1101 transitions. [2025-03-03 19:01:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:01:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 19:01:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:15,945 INFO L225 Difference]: With dead ends: 750 [2025-03-03 19:01:15,947 INFO L226 Difference]: Without dead ends: 435 [2025-03-03 19:01:15,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:01:15,949 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 273 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:15,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 561 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:01:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-03 19:01:15,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 320. [2025-03-03 19:01:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 233 states have (on average 1.351931330472103) internal successors, (315), 235 states have internal predecessors, (315), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 19:01:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 479 transitions. [2025-03-03 19:01:15,973 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 479 transitions. Word has length 176 [2025-03-03 19:01:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:15,974 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 479 transitions. [2025-03-03 19:01:15,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 479 transitions. [2025-03-03 19:01:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:01:15,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:15,975 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:01:15,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1991926094, now seen corresponding path program 1 times [2025-03-03 19:01:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178704919] [2025-03-03 19:01:15,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:15,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:01:16,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:01:16,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:16,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:01:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178704919] [2025-03-03 19:01:17,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178704919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:17,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:01:17,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 19:01:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888394082] [2025-03-03 19:01:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:01:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:17,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:01:17,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:01:17,009 INFO L87 Difference]: Start difference. First operand 320 states and 479 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:17,810 INFO L93 Difference]: Finished difference Result 775 states and 1139 transitions. [2025-03-03 19:01:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:01:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 19:01:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:17,814 INFO L225 Difference]: With dead ends: 775 [2025-03-03 19:01:17,814 INFO L226 Difference]: Without dead ends: 458 [2025-03-03 19:01:17,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:01:17,817 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 322 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:17,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 795 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:01:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-03 19:01:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 328. [2025-03-03 19:01:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 241 states have (on average 1.3568464730290457) internal successors, (327), 243 states have internal predecessors, (327), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 19:01:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 491 transitions. [2025-03-03 19:01:17,845 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 491 transitions. Word has length 176 [2025-03-03 19:01:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:17,845 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 491 transitions. [2025-03-03 19:01:17,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 491 transitions. [2025-03-03 19:01:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:01:17,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:17,847 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:17,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:01:17,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:17,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -475797966, now seen corresponding path program 1 times [2025-03-03 19:01:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858078550] [2025-03-03 19:01:17,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:17,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:17,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:01:17,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:01:17,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:17,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:01:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858078550] [2025-03-03 19:01:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858078550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:18,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:01:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:01:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718582905] [2025-03-03 19:01:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:18,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:01:18,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:01:18,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:01:18,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:01:18,048 INFO L87 Difference]: Start difference. First operand 328 states and 491 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:18,348 INFO L93 Difference]: Finished difference Result 603 states and 897 transitions. [2025-03-03 19:01:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:01:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-03 19:01:18,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:18,352 INFO L225 Difference]: With dead ends: 603 [2025-03-03 19:01:18,352 INFO L226 Difference]: Without dead ends: 446 [2025-03-03 19:01:18,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:01:18,354 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 186 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:18,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 708 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:01:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-03 19:01:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 425. [2025-03-03 19:01:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 295 states have (on average 1.3186440677966103) internal successors, (389), 298 states have internal predecessors, (389), 122 states have call successors, (122), 7 states have call predecessors, (122), 7 states have return successors, (122), 119 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-03 19:01:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 633 transitions. [2025-03-03 19:01:18,381 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 633 transitions. Word has length 176 [2025-03-03 19:01:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:18,381 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 633 transitions. [2025-03-03 19:01:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 633 transitions. [2025-03-03 19:01:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 19:01:18,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:18,383 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:01:18,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1267012369, now seen corresponding path program 1 times [2025-03-03 19:01:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:01:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058695935] [2025-03-03 19:01:18,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:01:18,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:01:18,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:01:18,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:18,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:01:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504797860] [2025-03-03 19:01:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:18,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:01:18,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:01:18,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:01:18,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 19:01:18,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:01:18,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:01:18,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:01:18,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:01:18,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 19:01:18,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 19:01:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:01:18,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:01:18,622 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:01:18,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:01:18,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 19:01:18,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 19:01:18,827 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:01:18,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:01:18,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:01:18 BoogieIcfgContainer [2025-03-03 19:01:18,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:01:18,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:01:18,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:01:18,911 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:01:18,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:00:55" (3/4) ... [2025-03-03 19:01:18,927 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:01:18,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:01:18,933 INFO L158 Benchmark]: Toolchain (without parser) took 23906.02ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 132.5MB in the beginning and 463.1MB in the end (delta: -330.6MB). Peak memory consumption was 298.3MB. Max. memory is 16.1GB. [2025-03-03 19:01:18,933 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:01:18,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.64ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 117.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:01:18,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 115.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:01:18,934 INFO L158 Benchmark]: Boogie Preprocessor took 37.35ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:01:18,934 INFO L158 Benchmark]: IcfgBuilder took 364.51ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 90.0MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:01:18,934 INFO L158 Benchmark]: TraceAbstraction took 23195.58ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 89.1MB in the beginning and 175.6MB in the end (delta: -86.5MB). Peak memory consumption was 246.2MB. Max. memory is 16.1GB. [2025-03-03 19:01:18,935 INFO L158 Benchmark]: Witness Printer took 20.37ms. Allocated memory is still 503.3MB. Free memory was 175.6MB in the beginning and 463.1MB in the end (delta: -287.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-03-03 19:01:18,936 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.64ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 117.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 115.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.35ms. Allocated memory is still 167.8MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 364.51ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 90.0MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23195.58ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 89.1MB in the beginning and 175.6MB in the end (delta: -86.5MB). Peak memory consumption was 246.2MB. Max. memory is 16.1GB. * Witness Printer took 20.37ms. Allocated memory is still 503.3MB. Free memory was 175.6MB in the beginning and 463.1MB in the end (delta: -287.4MB). Peak memory consumption was 10.2MB. 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 122, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someUnaryFLOAToperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned short int var_1_6 = 25; [L28] signed char var_1_7 = 5; [L29] signed char var_1_8 = -5; [L30] double var_1_9 = 999.625; [L31] double var_1_10 = 5.06; [L32] unsigned short int var_1_11 = 5; [L33] signed short int var_1_12 = 2; [L34] signed long int var_1_13 = -256; [L35] double var_1_14 = 127.75; [L36] double var_1_15 = 9.75; [L37] float var_1_16 = 32.8; [L38] float var_1_17 = 32.5; [L39] float var_1_18 = 1.75; [L40] float var_1_19 = 1000000000000000.4; [L41] float var_1_20 = 0.875; [L42] unsigned char var_1_21 = 0; [L43] unsigned char var_1_22 = 0; [L44] signed short int var_1_23 = 64; [L45] signed short int var_1_24 = 25; [L46] signed short int var_1_25 = 0; VAL [isInitial=0, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L97] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L97] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L100] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L100] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L102] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L103] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L103] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L104] var_1_7 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L105] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L106] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L106] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L107] var_1_8 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_8 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L108] RET assume_abort_if_not(var_1_8 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L109] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L109] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L111] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L112] var_1_10 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L113] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L114] var_1_11 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L116] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L117] var_1_15 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L118] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L119] var_1_17 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L120] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L121] var_1_18 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L122] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L123] var_1_19 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L124] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L126] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L127] var_1_22 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L128] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L129] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L129] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L130] var_1_24 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L131] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L132] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L132] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L133] var_1_25 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L134] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L135] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L135] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L148] RET updateVariables() [L149] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = ((! var_1_3) || var_1_4) VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L55] signed char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=0, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L56] COND TRUE stepLocal_0 >= var_1_8 VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L57] COND TRUE (var_1_9 - 1.00000000000025E12) >= var_1_10 [L58] var_1_6 = 200 VAL [isInitial=1, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L65] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=200, var_1_11=201, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L66] COND TRUE var_1_11 > stepLocal_1 [L67] var_1_12 = 32 VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L69] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, stepLocal_2=0, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L70] COND FALSE !(var_1_12 == stepLocal_2) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L75] EXPR var_1_11 >> var_1_8 VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L75] COND TRUE (var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12) [L76] var_1_14 = var_1_15 VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L80] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L81] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, stepLocal_3=200, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L82] COND FALSE !(var_1_11 == stepLocal_3) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L85] COND TRUE var_1_18 > var_1_9 [L86] var_1_23 = (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR ((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L140-L141] return (((((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))))) : (var_1_23 == ((signed short int) (var_1_7 + 1)))) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=201, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=0, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1753 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1753 mSDsluCounter, 4841 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3704 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3836 IncrementalHoareTripleChecker+Invalid, 3946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 1137 mSDtfsCounter, 3836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1202 GetRequests, 1038 SyntacticMatches, 8 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=9, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 749 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 2630 NumberOfCodeBlocks, 2630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2613 ConstructedInterpolants, 1 QuantifiedInterpolants, 16674 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1556 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 20381/21060 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 19:01:19,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.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 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:01:20,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:01:20,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:01:20,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:01:20,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:01:20,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:01:20,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:01:20,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:01:20,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:01:20,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:01:20,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:01:20,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:01:20,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:01:20,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:01:20,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:01:20,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:01:20,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:01:20,899 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 -> 57c3b59e617031810541c352683e22355f7d2bb210fb0588faea84e9b25c6bba [2025-03-03 19:01:21,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:01:21,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:01:21,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:01:21,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:01:21,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:01:21,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2025-03-03 19:01:22,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df32245d/ff71c7376cb64291bfd5a3e2f31be8e6/FLAGf0c1abe64 [2025-03-03 19:01:22,442 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:01:22,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-35.i [2025-03-03 19:01:22,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df32245d/ff71c7376cb64291bfd5a3e2f31be8e6/FLAGf0c1abe64 [2025-03-03 19:01:22,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1df32245d/ff71c7376cb64291bfd5a3e2f31be8e6 [2025-03-03 19:01:22,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:01:22,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:01:22,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:01:22,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:01:22,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:01:22,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:01:22" (1/1) ... [2025-03-03 19:01:22,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1442e5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:22, skipping insertion in model container [2025-03-03 19:01:22,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:01:22" (1/1) ... [2025-03-03 19:01:22,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:01:22,951 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_codestructure_steplocals_file-35.i[917,930] [2025-03-03 19:01:23,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:01:23,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:01:23,038 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_codestructure_steplocals_file-35.i[917,930] [2025-03-03 19:01:23,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:01:23,098 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:01:23,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23 WrapperNode [2025-03-03 19:01:23,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:01:23,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:01:23,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:01:23,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:01:23,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,146 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-03-03 19:01:23,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:01:23,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:01:23,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:01:23,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:01:23,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,172 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 19:01:23,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:01:23,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:01:23,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:01:23,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:01:23,197 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (1/1) ... [2025-03-03 19:01:23,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:01:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:01:23,223 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 19:01:23,229 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 19:01:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:01:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:01:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:01:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:01:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:01:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:01:23,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:01:23,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:01:24,881 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 19:01:24,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:01:24,889 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:01:24,889 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:01:24,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:01:24 BoogieIcfgContainer [2025-03-03 19:01:24,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:01:24,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:01:24,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:01:24,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:01:24,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:01:22" (1/3) ... [2025-03-03 19:01:24,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c026824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:01:24, skipping insertion in model container [2025-03-03 19:01:24,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:01:23" (2/3) ... [2025-03-03 19:01:24,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c026824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:01:24, skipping insertion in model container [2025-03-03 19:01:24,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:01:24" (3/3) ... [2025-03-03 19:01:24,897 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-35.i [2025-03-03 19:01:24,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:01:24,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-35.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:01:24,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:01:24,949 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;@19811d9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:01:24,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:01:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:01:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 19:01:24,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:24,960 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:24,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2056104740, now seen corresponding path program 1 times [2025-03-03 19:01:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:01:24,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444456091] [2025-03-03 19:01:24,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:24,974 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 19:01:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:01:24,976 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 19:01:24,977 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 19:01:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:01:25,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:01:25,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:25,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:25,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:01:25,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:01:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 19:01:25,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:01:25,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:01:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444456091] [2025-03-03 19:01:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444456091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:25,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:01:25,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:01:25,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549298496] [2025-03-03 19:01:25,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:25,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:01:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:01:25,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:01:25,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:01:25,348 INFO L87 Difference]: Start difference. First operand has 75 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:01:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:25,372 INFO L93 Difference]: Finished difference Result 144 states and 246 transitions. [2025-03-03 19:01:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:01:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2025-03-03 19:01:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:25,379 INFO L225 Difference]: With dead ends: 144 [2025-03-03 19:01:25,379 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 19:01:25,382 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 19:01:25,383 INFO L435 NwaCegarLoop]: 107 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, 107 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 19:01:25,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:01:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 19:01:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 19:01:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:01:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2025-03-03 19:01:25,412 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 172 [2025-03-03 19:01:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:25,413 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2025-03-03 19:01:25,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 19:01:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2025-03-03 19:01:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 19:01:25,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:25,415 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:25,433 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 19:01:25,621 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 19:01:25,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:25,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1940008839, now seen corresponding path program 1 times [2025-03-03 19:01:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:01:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130739804] [2025-03-03 19:01:25,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:25,624 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 19:01:25,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:01:25,625 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 19:01:25,627 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 19:01:25,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:01:25,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:01:25,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:25,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 19:01:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:01:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 19:01:25,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:01:25,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:01:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130739804] [2025-03-03 19:01:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130739804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:01:25,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:01:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:01:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292811890] [2025-03-03 19:01:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:01:25,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:01:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:01:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:01:25,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:01:25,992 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:28,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:01:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:01:28,332 INFO L93 Difference]: Finished difference Result 184 states and 273 transitions. [2025-03-03 19:01:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:01:28,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-03 19:01:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:01:28,335 INFO L225 Difference]: With dead ends: 184 [2025-03-03 19:01:28,335 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 19:01:28,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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 19:01:28,336 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 60 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:01:28,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 331 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 19:01:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 19:01:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2025-03-03 19:01:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 69 states have internal predecessors, (84), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 19:01:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2025-03-03 19:01:28,360 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 172 [2025-03-03 19:01:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:01:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2025-03-03 19:01:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 19:01:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2025-03-03 19:01:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 19:01:28,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:01:28,362 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:01:28,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 19:01:28,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:01:28,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:01:28,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:01:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash 558007098, now seen corresponding path program 1 times [2025-03-03 19:01:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:01:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115917918] [2025-03-03 19:01:28,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:01:28,575 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 19:01:28,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:01:28,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:01:28,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:01:28,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 19:01:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 19:01:28,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:01:28,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:01:28,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 19:01:29,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:02:11,937 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)