./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.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 2b1ff31db509e6effa7c7aab233d1c51ba648bc5079bf259c615627714f8cf03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:15:58,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:15:59,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:15:59,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:15:59,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:15:59,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:15:59,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:15:59,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:15:59,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:15:59,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:15:59,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:15:59,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:15:59,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:15:59,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:15:59,034 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:15:59,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:15:59,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:15:59,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:15:59,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:15:59,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:15:59,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:15:59,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:15:59,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:15:59,036 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 -> 2b1ff31db509e6effa7c7aab233d1c51ba648bc5079bf259c615627714f8cf03 [2025-03-08 10:15:59,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:15:59,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:15:59,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:15:59,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:15:59,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:15:59,280 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-66.i [2025-03-08 10:16:00,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbcd95ba/0b8996316be842fa9fcb402f6925be7a/FLAG31966bc0e [2025-03-08 10:16:00,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:16:00,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.i [2025-03-08 10:16:00,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbcd95ba/0b8996316be842fa9fcb402f6925be7a/FLAG31966bc0e [2025-03-08 10:16:00,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccbcd95ba/0b8996316be842fa9fcb402f6925be7a [2025-03-08 10:16:00,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:16:00,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:16:00,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:16:00,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:16:00,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:16:00,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00, skipping insertion in model container [2025-03-08 10:16:00,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:16:00,804 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-66.i[917,930] [2025-03-08 10:16:00,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:16:00,877 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:16:00,885 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-66.i[917,930] [2025-03-08 10:16:00,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:16:00,930 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:16:00,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00 WrapperNode [2025-03-08 10:16:00,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:16:00,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:16:00,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:16:00,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:16:00,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,977 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-03-08 10:16:00,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:16:00,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:16:00,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:16:00,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:16:00,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:16:01,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:16:01,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:16:01,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:16:01,030 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:16:01,031 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:16:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:16:01,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:16:01,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:16:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:16:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:16:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:16:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:16:01,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:16:01,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:16:01,141 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:16:01,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:16:01,441 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:16:01,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:16:01,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:16:01,455 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:16:01,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:01 BoogieIcfgContainer [2025-03-08 10:16:01,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:16:01,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:16:01,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:16:01,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:16:01,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:16:00" (1/3) ... [2025-03-08 10:16:01,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2607bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:16:01, skipping insertion in model container [2025-03-08 10:16:01,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (2/3) ... [2025-03-08 10:16:01,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2607bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:16:01, skipping insertion in model container [2025-03-08 10:16:01,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:01" (3/3) ... [2025-03-08 10:16:01,464 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-66.i [2025-03-08 10:16:01,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:16:01,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-66.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:16:01,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:16:01,527 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;@4a91cac4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:16:01,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:16:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:16:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:16:01,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:01,540 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:01,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:01,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash -448646302, now seen corresponding path program 1 times [2025-03-08 10:16:01,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-08 10:16:01,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:01,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:01,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:01,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:01,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:01,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 10:16:01,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:01,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729601047] [2025-03-08 10:16:01,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729601047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:16:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630239890] [2025-03-08 10:16:01,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:01,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:16:01,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:16:01,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:16:01,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:16:01,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:01,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:01,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:01,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:01,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:16:01,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:16:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 10:16:01,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:16:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630239890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:16:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:16:01,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748091194] [2025-03-08 10:16:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:16:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:01,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:16:01,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:16:01,987 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:16:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:02,003 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2025-03-08 10:16:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:16:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-03-08 10:16:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:02,008 INFO L225 Difference]: With dead ends: 140 [2025-03-08 10:16:02,008 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 10:16:02,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:16:02,012 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-08 10:16:02,012 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-08 10:16:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 10:16:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-08 10:16:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:16:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2025-03-08 10:16:02,044 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 164 [2025-03-08 10:16:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:02,044 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2025-03-08 10:16:02,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:16:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2025-03-08 10:16:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:16:02,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:02,047 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:02,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:16:02,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:16:02,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:02,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1180860734, now seen corresponding path program 1 times [2025-03-08 10:16:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:02,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-03-08 10:16:02,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:02,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:02,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:02,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:02,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:02,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:16:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:05,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307481374] [2025-03-08 10:16:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307481374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 10:16:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675293951] [2025-03-08 10:16:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:05,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:16:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:05,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:16:05,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:16:05,722 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:06,289 INFO L93 Difference]: Finished difference Result 254 states and 368 transitions. [2025-03-08 10:16:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 10:16:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-03-08 10:16:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:06,292 INFO L225 Difference]: With dead ends: 254 [2025-03-08 10:16:06,293 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 10:16:06,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:16:06,294 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 253 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:06,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 470 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:16:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 10:16:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 85. [2025-03-08 10:16:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:16:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2025-03-08 10:16:06,314 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 164 [2025-03-08 10:16:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:06,315 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2025-03-08 10:16:06,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2025-03-08 10:16:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:16:06,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:06,319 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:06,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:16:06,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1179937213, now seen corresponding path program 1 times [2025-03-08 10:16:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231818312] [2025-03-08 10:16:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:06,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:06,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:06,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:06,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:16:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231818312] [2025-03-08 10:16:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231818312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 10:16:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771378821] [2025-03-08 10:16:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:18,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:16:18,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:18,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:16:18,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:16:18,843 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:19,825 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-03-08 10:16:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 10:16:19,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-03-08 10:16:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:19,827 INFO L225 Difference]: With dead ends: 164 [2025-03-08 10:16:19,828 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 10:16:19,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:16:19,828 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 211 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:19,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 486 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:16:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 10:16:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 87. [2025-03-08 10:16:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:16:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-03-08 10:16:19,836 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 164 [2025-03-08 10:16:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:19,837 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-03-08 10:16:19,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-03-08 10:16:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:16:19,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:19,839 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:19,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:16:19,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 561949601, now seen corresponding path program 1 times [2025-03-08 10:16:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703617546] [2025-03-08 10:16:19,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:19,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:19,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:19,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:19,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:16:24,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:24,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703617546] [2025-03-08 10:16:24,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703617546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:24,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:24,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:16:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264506493] [2025-03-08 10:16:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:24,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:16:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:24,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:16:24,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:16:24,507 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:25,961 INFO L93 Difference]: Finished difference Result 210 states and 296 transitions. [2025-03-08 10:16:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:16:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-03-08 10:16:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:25,963 INFO L225 Difference]: With dead ends: 210 [2025-03-08 10:16:25,963 INFO L226 Difference]: Without dead ends: 208 [2025-03-08 10:16:25,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:16:25,964 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 223 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:25,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 482 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:16:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-08 10:16:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 97. [2025-03-08 10:16:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 69 states have internal predecessors, (97), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:16:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2025-03-08 10:16:25,980 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 164 [2025-03-08 10:16:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:25,980 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2025-03-08 10:16:25,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2025-03-08 10:16:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:16:25,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:25,984 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:25,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:16:25,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:25,985 INFO L85 PathProgramCache]: Analyzing trace with hash 562873122, now seen corresponding path program 1 times [2025-03-08 10:16:25,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:25,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025221658] [2025-03-08 10:16:25,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:25,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:25,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:26,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:26,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:26,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:16:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:41,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025221658] [2025-03-08 10:16:41,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025221658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 10:16:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929985694] [2025-03-08 10:16:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:41,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 10:16:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:41,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 10:16:41,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-08 10:16:41,322 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:42,629 INFO L93 Difference]: Finished difference Result 156 states and 227 transitions. [2025-03-08 10:16:42,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 10:16:42,630 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-03-08 10:16:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:42,631 INFO L225 Difference]: With dead ends: 156 [2025-03-08 10:16:42,631 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 10:16:42,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:16:42,632 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 150 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 547 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:16:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 10:16:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 87. [2025-03-08 10:16:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:16:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2025-03-08 10:16:42,648 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 164 [2025-03-08 10:16:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:42,649 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2025-03-08 10:16:42,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 10:16:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2025-03-08 10:16:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:16:42,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:42,652 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:42,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:16:42,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:42,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1317155203, now seen corresponding path program 1 times [2025-03-08 10:16:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:42,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896118416] [2025-03-08 10:16:42,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:16:42,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:16:42,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:42,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 10:16:42,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896118416] [2025-03-08 10:16:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896118416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:42,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:42,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:16:42,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717824443] [2025-03-08 10:16:42,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:42,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:16:42,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:42,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:16:42,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:16:42,902 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:16:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:43,108 INFO L93 Difference]: Finished difference Result 205 states and 311 transitions. [2025-03-08 10:16:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:16:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-03-08 10:16:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:43,110 INFO L225 Difference]: With dead ends: 205 [2025-03-08 10:16:43,111 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 10:16:43,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:43,113 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 127 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:43,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 199 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:16:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 10:16:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2025-03-08 10:16:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.345679012345679) internal successors, (109), 82 states have internal predecessors, (109), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 10:16:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 177 transitions. [2025-03-08 10:16:43,128 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 177 transitions. Word has length 164 [2025-03-08 10:16:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:43,129 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 177 transitions. [2025-03-08 10:16:43,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:16:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 177 transitions. [2025-03-08 10:16:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 10:16:43,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:43,130 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:43,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:16:43,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:43,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:43,131 INFO L85 PathProgramCache]: Analyzing trace with hash 5813131, now seen corresponding path program 1 times [2025-03-08 10:16:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350359953] [2025-03-08 10:16:43,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:43,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:16:43,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:16:43,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:43,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:16:43,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152095188] [2025-03-08 10:16:43,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:43,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:16:43,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:16:43,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:16:43,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:16:43,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:16:43,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:16:43,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:43,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:43,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 10:16:43,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:16:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 822 proven. 138 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 10:16:43,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:17:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:17:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350359953] [2025-03-08 10:17:06,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 10:17:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152095188] [2025-03-08 10:17:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152095188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:17:06,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:17:06,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-08 10:17:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652911044] [2025-03-08 10:17:06,749 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 10:17:06,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 10:17:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:17:06,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 10:17:06,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=274, Unknown=5, NotChecked=0, Total=342 [2025-03-08 10:17:06,751 INFO L87 Difference]: Start difference. First operand 118 states and 177 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 10:17:11,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-08 10:17:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:17:13,647 INFO L93 Difference]: Finished difference Result 311 states and 445 transitions. [2025-03-08 10:17:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 10:17:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 165 [2025-03-08 10:17:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:17:13,652 INFO L225 Difference]: With dead ends: 311 [2025-03-08 10:17:13,652 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 10:17:13,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=229, Invalid=636, Unknown=5, NotChecked=0, Total=870 [2025-03-08 10:17:13,653 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 216 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:17:13,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 388 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 10:17:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 10:17:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2025-03-08 10:17:13,668 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), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 10:17:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2025-03-08 10:17:13,671 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 165 [2025-03-08 10:17:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:17:13,673 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2025-03-08 10:17:13,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 10:17:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2025-03-08 10:17:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 10:17:13,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:13,674 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:13,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:17:13,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 10:17:13,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1748623466, now seen corresponding path program 1 times [2025-03-08 10:17:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:17:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818223542] [2025-03-08 10:17:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:17:13,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:17:13,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:17:13,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:13,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:17:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392568760] [2025-03-08 10:17:13,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:13,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:17:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:17:13,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:17:13,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:17:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:17:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:17:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:17:13,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:17:14,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 10:17:14,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 10:17:14,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:14,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:17:14,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:17:14,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:17:14,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:17:14,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 10:17:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:17:14,285 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:14,366 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:17:14,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:17:14 BoogieIcfgContainer [2025-03-08 10:17:14,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:17:14,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:17:14,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:17:14,370 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:17:14,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:01" (3/4) ... [2025-03-08 10:17:14,371 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:17:14,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:17:14,373 INFO L158 Benchmark]: Toolchain (without parser) took 73701.29ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 112.7MB in the beginning and 630.0MB in the end (delta: -517.3MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.17ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: IcfgBuilder took 427.48ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 70.3MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: TraceAbstraction took 72911.68ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 69.9MB in the beginning and 630.2MB in the end (delta: -560.4MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2025-03-08 10:17:14,373 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 880.8MB. Free memory was 630.2MB in the beginning and 630.0MB in the end (delta: 186.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:14,376 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.53ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.17ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.51ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 92.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 427.48ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 70.3MB in the end (delta: 21.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 72911.68ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 69.9MB in the beginning and 630.2MB in the end (delta: -560.4MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 880.8MB. Free memory was 630.2MB in the beginning and 630.0MB in the end (delta: 186.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 10; [L26] double var_1_5 = 16.5; [L27] signed char var_1_6 = 64; [L28] signed char var_1_7 = 2; [L29] unsigned short int var_1_8 = 256; [L30] unsigned char var_1_9 = 0; [L31] unsigned short int var_1_10 = 63583; [L32] unsigned short int var_1_11 = 33789; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] signed long int var_1_15 = 8; [L37] signed short int var_1_16 = -16; [L38] unsigned short int var_1_17 = 32; [L39] signed short int var_1_18 = 16; [L40] signed short int var_1_19 = 25; [L41] signed short int var_1_20 = 25; [L42] signed short int var_1_21 = 50; VAL [isInitial=0, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=0, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] FCALL updateLastVariables() [L142] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] var_1_3 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L97] var_1_4 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L98] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L99] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L100] var_1_6 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L101] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L102] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L103] var_1_7 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=0] [L104] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=0] [L105] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=0] [L106] var_1_9 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L107] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L108] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L109] var_1_10 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L110] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L111] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L112] var_1_11 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L113] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L114] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L115] var_1_13 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L116] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L117] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L117] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L118] var_1_14 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L120] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L120] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L121] var_1_17 = __VERIFIER_nondet_ushort() [L122] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L122] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L123] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L123] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L124] var_1_20 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L126] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L127] var_1_21 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L128] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L129] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L142] RET updateVariables() [L143] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L49] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L50] COND TRUE \read(var_1_2) [L51] var_1_5 = 8.25 VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L54] unsigned char stepLocal_1 = var_1_9; [L55] signed char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=-1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=256, var_1_9=1] [L56] COND FALSE !(-25 == stepLocal_0) [L61] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L63] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=1, stepLocal_2=65534, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L64] COND TRUE stepLocal_2 >= var_1_7 [L65] var_1_12 = (! var_1_14) VAL [isInitial=1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L67] COND TRUE -64 > (var_1_6 + var_1_1) [L68] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L76] signed long int stepLocal_3 = ((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10); VAL [isInitial=1, stepLocal_1=1, stepLocal_3=65536, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L77] COND FALSE !(var_1_8 > stepLocal_3) VAL [isInitial=1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L80] signed char stepLocal_4 = var_1_1; VAL [isInitial=1, stepLocal_1=1, stepLocal_4=-126, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L81] COND TRUE stepLocal_4 < var_1_6 [L82] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=-128, var_1_19=25, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L86] COND TRUE \read(var_1_13) [L87] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, stepLocal_1=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=-128, var_1_19=126, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return (((((((var_1_2 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_2 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((var_1_2 && var_1_9) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_1)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_13 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=-128, var_1_19=126, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=-128, var_1_19=126, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=49150, var_1_11=65534, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=65407, var_1_16=-16, var_1_17=-131073, var_1_18=-128, var_1_19=126, var_1_1=-126, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=65534, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 138 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.8s, OverallIterations: 8, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1204 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1180 mSDsluCounter, 2679 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2035 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2090 IncrementalHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 644 mSDtfsCounter, 2090 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 31.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=7, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 414 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1305 ConstructedInterpolants, 1 QuantifiedInterpolants, 10350 SizeOfPredicates, 8 NumberOfNonLiveVariables, 739 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 10212/10400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:17:14,584 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 10:17:14,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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-66.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 2b1ff31db509e6effa7c7aab233d1c51ba648bc5079bf259c615627714f8cf03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:17:16,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:17:16,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:17:16,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:17:16,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:17:16,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:17:16,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:17:16,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:17:16,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:17:16,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:17:16,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:17:16,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:17:16,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:17:16,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:17:16,455 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:17:16,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:17:16,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:17:16,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:17:16,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:17:16,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:17:16,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:17:16,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:17:16,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:17:16,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:17:16,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:17:16,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:17:16,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:17:16,458 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 -> 2b1ff31db509e6effa7c7aab233d1c51ba648bc5079bf259c615627714f8cf03 [2025-03-08 10:17:16,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:17:16,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:17:16,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:17:16,686 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:17:16,687 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:17:16,688 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-66.i [2025-03-08 10:17:17,888 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc871ee14/05870366c1b84d84a13b73993401d6d9/FLAG53a045ad4 [2025-03-08 10:17:18,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:17:18,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-66.i [2025-03-08 10:17:18,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc871ee14/05870366c1b84d84a13b73993401d6d9/FLAG53a045ad4 [2025-03-08 10:17:18,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc871ee14/05870366c1b84d84a13b73993401d6d9 [2025-03-08 10:17:18,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:17:18,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:17:18,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:17:18,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:17:18,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:17:18,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47124536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18, skipping insertion in model container [2025-03-08 10:17:18,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:17:18,580 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-66.i[917,930] [2025-03-08 10:17:18,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:17:18,660 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:17:18,669 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-66.i[917,930] [2025-03-08 10:17:18,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:17:18,722 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:17:18,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18 WrapperNode [2025-03-08 10:17:18,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:17:18,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:17:18,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:17:18,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:17:18,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,756 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-08 10:17:18,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:17:18,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:17:18,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:17:18,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:17:18,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,780 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:17:18,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:17:18,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:17:18,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:17:18,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:17:18,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (1/1) ... [2025-03-08 10:17:18,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:17:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:17:18,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:17:18,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:17:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:17:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:17:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:17:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:17:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:17:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:17:18,909 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:17:18,910 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:17:19,270 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:17:19,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:17:19,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:17:19,295 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:17:19,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:19 BoogieIcfgContainer [2025-03-08 10:17:19,295 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:17:19,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:17:19,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:17:19,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:17:19,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:17:18" (1/3) ... [2025-03-08 10:17:19,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1086ba32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:19, skipping insertion in model container [2025-03-08 10:17:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:18" (2/3) ... [2025-03-08 10:17:19,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1086ba32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:19, skipping insertion in model container [2025-03-08 10:17:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:19" (3/3) ... [2025-03-08 10:17:19,303 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-66.i [2025-03-08 10:17:19,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:17:19,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-66.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:17:19,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:17:19,372 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;@4d05e6f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:17:19,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:17:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:17:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:17:19,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:19,387 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:19,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -448646302, now seen corresponding path program 1 times [2025-03-08 10:17:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:17:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373590542] [2025-03-08 10:17:19,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:19,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:17:19,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:17:19,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:17:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:17:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:17:19,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:17:19,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:17:19,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:17:19,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:17:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-08 10:17:19,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:17:19,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:17:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373590542] [2025-03-08 10:17:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373590542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:17:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:17:19,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:17:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829058839] [2025-03-08 10:17:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:17:19,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:17:19,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:17:19,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:17:19,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:17:19,656 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:17:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:17:19,683 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2025-03-08 10:17:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:17:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-03-08 10:17:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:17:19,690 INFO L225 Difference]: With dead ends: 140 [2025-03-08 10:17:19,691 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 10:17:19,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:17:19,698 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-08 10:17:19,699 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-08 10:17:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 10:17:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-08 10:17:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 10:17:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2025-03-08 10:17:19,734 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 164 [2025-03-08 10:17:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:17:19,734 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2025-03-08 10:17:19,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 10:17:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2025-03-08 10:17:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 10:17:19,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:19,737 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:19,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:17:19,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:17:19,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:19,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1180860734, now seen corresponding path program 1 times [2025-03-08 10:17:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:17:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632793708] [2025-03-08 10:17:19,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:17:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:17:19,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:17:19,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:17:20,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 10:17:20,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 10:17:20,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:20,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:17:20,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 10:17:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates...