./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --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/bitvector/s3_clnt_2.BV.c.cil-1a.c -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 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:53:07,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:07,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:53:07,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:07,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:07,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:07,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:07,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:07,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:07,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:07,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:07,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:07,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:07,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:07,929 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:07,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:07,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:07,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:07,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:07,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:07,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:07,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:07,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:07,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:07,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:07,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:07,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:07,932 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 -> 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f [2025-03-08 00:53:08,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:08,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:08,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:08,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:08,156 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:08,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-03-08 00:53:09,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0029116/3e3c75dcaccd45c9a207d61b34d63df6/FLAG39cb96055 [2025-03-08 00:53:09,511 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:09,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-03-08 00:53:09,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0029116/3e3c75dcaccd45c9a207d61b34d63df6/FLAG39cb96055 [2025-03-08 00:53:09,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed0029116/3e3c75dcaccd45c9a207d61b34d63df6 [2025-03-08 00:53:09,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:09,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:09,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:09,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:09,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:09,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13f7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09, skipping insertion in model container [2025-03-08 00:53:09,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:09,727 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/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-03-08 00:53:09,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:09,746 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:09,770 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/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-03-08 00:53:09,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:09,780 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:09,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09 WrapperNode [2025-03-08 00:53:09,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:09,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:09,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:09,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:09,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,816 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 515 [2025-03-08 00:53:09,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:09,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:09,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:09,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:09,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,848 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 00:53:09,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:09,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:09,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:09,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:09,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (1/1) ... [2025-03-08 00:53:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:09,885 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 00:53:09,888 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 00:53:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:53:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:09,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:09,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:09,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:10,300 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume false; [2025-03-08 00:53:10,300 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume !false; [2025-03-08 00:53:10,332 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:10,332 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:10,351 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:10,351 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:53:10,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:10 BoogieIcfgContainer [2025-03-08 00:53:10,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:10,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:10,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:10,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:10,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:09" (1/3) ... [2025-03-08 00:53:10,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404bb3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:10, skipping insertion in model container [2025-03-08 00:53:10,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:09" (2/3) ... [2025-03-08 00:53:10,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404bb3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:10, skipping insertion in model container [2025-03-08 00:53:10,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:10" (3/3) ... [2025-03-08 00:53:10,359 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2025-03-08 00:53:10,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:10,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_2.BV.c.cil-1a.c that has 1 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:53:10,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:10,420 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;@6bbe6d96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:10,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7244094488188977) internal successors, (219), 128 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:53:10,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:10,428 INFO L218 NwaCegarLoop]: trace histogram [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 00:53:10,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:10,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 599588957, now seen corresponding path program 1 times [2025-03-08 00:53:10,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:10,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076099103] [2025-03-08 00:53:10,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:10,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:10,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:53:10,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:53:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:53:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076099103] [2025-03-08 00:53:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076099103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786611577] [2025-03-08 00:53:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:10,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:10,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:10,627 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7244094488188977) internal successors, (219), 128 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:10,754 INFO L93 Difference]: Finished difference Result 253 states and 431 transitions. [2025-03-08 00:53:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:10,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 00:53:10,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:10,761 INFO L225 Difference]: With dead ends: 253 [2025-03-08 00:53:10,761 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 00:53:10,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:10,765 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:10,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 331 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 00:53:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 00:53:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 114 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2025-03-08 00:53:10,789 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 23 [2025-03-08 00:53:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2025-03-08 00:53:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2025-03-08 00:53:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:53:10,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:10,791 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:53:10,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 92381796, now seen corresponding path program 1 times [2025-03-08 00:53:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978289456] [2025-03-08 00:53:10,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:10,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:53:10,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:53:10,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:10,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:53:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978289456] [2025-03-08 00:53:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978289456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:10,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:10,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:10,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097635180] [2025-03-08 00:53:10,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:10,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:10,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:10,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:10,879 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:10,984 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2025-03-08 00:53:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:10,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 00:53:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:10,985 INFO L225 Difference]: With dead ends: 235 [2025-03-08 00:53:10,985 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 00:53:10,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:10,987 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:10,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 250 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 00:53:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 00:53:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.515625) internal successors, (194), 128 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 194 transitions. [2025-03-08 00:53:10,997 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 194 transitions. Word has length 34 [2025-03-08 00:53:10,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:10,998 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 194 transitions. [2025-03-08 00:53:10,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 194 transitions. [2025-03-08 00:53:10,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:11,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:11,000 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 00:53:11,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:53:11,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:11,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash 546095738, now seen corresponding path program 1 times [2025-03-08 00:53:11,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:11,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571708663] [2025-03-08 00:53:11,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:11,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:53:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571708663] [2025-03-08 00:53:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571708663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:11,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339318155] [2025-03-08 00:53:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:11,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:11,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:11,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,055 INFO L87 Difference]: Start difference. First operand 129 states and 194 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:11,149 INFO L93 Difference]: Finished difference Result 265 states and 404 transitions. [2025-03-08 00:53:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-08 00:53:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:11,151 INFO L225 Difference]: With dead ends: 265 [2025-03-08 00:53:11,152 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 00:53:11,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,153 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:11,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 263 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 00:53:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-08 00:53:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4930555555555556) internal successors, (215), 144 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-08 00:53:11,160 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 47 [2025-03-08 00:53:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-08 00:53:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-08 00:53:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:53:11,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:11,161 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:53:11,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:11,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:11,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1415117339, now seen corresponding path program 1 times [2025-03-08 00:53:11,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047289019] [2025-03-08 00:53:11,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:11,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:11,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 00:53:11,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:53:11,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:11,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:11,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:11,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047289019] [2025-03-08 00:53:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047289019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:11,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543685087] [2025-03-08 00:53:11,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:11,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:11,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,271 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:11,410 INFO L93 Difference]: Finished difference Result 322 states and 494 transitions. [2025-03-08 00:53:11,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:11,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 00:53:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:11,412 INFO L225 Difference]: With dead ends: 322 [2025-03-08 00:53:11,412 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 00:53:11,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,414 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:11,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 229 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 00:53:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-08 00:53:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.434782608695652) internal successors, (264), 184 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 264 transitions. [2025-03-08 00:53:11,423 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 264 transitions. Word has length 63 [2025-03-08 00:53:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:11,423 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 264 transitions. [2025-03-08 00:53:11,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 264 transitions. [2025-03-08 00:53:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:53:11,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:11,424 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:11,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:53:11,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:11,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash 841793668, now seen corresponding path program 1 times [2025-03-08 00:53:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079217761] [2025-03-08 00:53:11,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:11,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 00:53:11,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:53:11,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079217761] [2025-03-08 00:53:11,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079217761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:11,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917517890] [2025-03-08 00:53:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:11,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:11,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:11,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,488 INFO L87 Difference]: Start difference. First operand 185 states and 264 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:11,577 INFO L93 Difference]: Finished difference Result 379 states and 548 transitions. [2025-03-08 00:53:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 00:53:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:11,578 INFO L225 Difference]: With dead ends: 379 [2025-03-08 00:53:11,579 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 00:53:11,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,580 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:11,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 268 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 00:53:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 00:53:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4207920792079207) internal successors, (287), 202 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 287 transitions. [2025-03-08 00:53:11,594 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 287 transitions. Word has length 63 [2025-03-08 00:53:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:11,595 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 287 transitions. [2025-03-08 00:53:11,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 287 transitions. [2025-03-08 00:53:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 00:53:11,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:11,596 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:11,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:53:11,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:11,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2102500193, now seen corresponding path program 1 times [2025-03-08 00:53:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:11,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851379985] [2025-03-08 00:53:11,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:11,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 00:53:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:53:11,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:53:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851379985] [2025-03-08 00:53:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851379985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:11,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:11,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822864689] [2025-03-08 00:53:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:11,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:11,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,664 INFO L87 Difference]: Start difference. First operand 203 states and 287 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:11,768 INFO L93 Difference]: Finished difference Result 417 states and 598 transitions. [2025-03-08 00:53:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 00:53:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:11,770 INFO L225 Difference]: With dead ends: 417 [2025-03-08 00:53:11,770 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 00:53:11,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,771 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:11,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 267 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 00:53:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-08 00:53:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.4054054054054055) internal successors, (312), 222 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 312 transitions. [2025-03-08 00:53:11,777 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 312 transitions. Word has length 78 [2025-03-08 00:53:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:11,777 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 312 transitions. [2025-03-08 00:53:11,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 312 transitions. [2025-03-08 00:53:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 00:53:11,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:11,778 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:11,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:53:11,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:11,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1167412548, now seen corresponding path program 1 times [2025-03-08 00:53:11,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:11,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395482339] [2025-03-08 00:53:11,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:11,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:11,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 00:53:11,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 00:53:11,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:11,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:53:11,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395482339] [2025-03-08 00:53:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395482339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139756339] [2025-03-08 00:53:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:11,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:11,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,872 INFO L87 Difference]: Start difference. First operand 223 states and 312 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:11,902 INFO L93 Difference]: Finished difference Result 648 states and 908 transitions. [2025-03-08 00:53:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 00:53:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:11,904 INFO L225 Difference]: With dead ends: 648 [2025-03-08 00:53:11,904 INFO L226 Difference]: Without dead ends: 434 [2025-03-08 00:53:11,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,905 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 131 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:11,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 367 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-08 00:53:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2025-03-08 00:53:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.3926096997690531) internal successors, (603), 433 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 603 transitions. [2025-03-08 00:53:11,919 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 603 transitions. Word has length 97 [2025-03-08 00:53:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:11,919 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 603 transitions. [2025-03-08 00:53:11,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 603 transitions. [2025-03-08 00:53:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 00:53:11,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:11,921 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:11,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:53:11,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:11,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1196935643, now seen corresponding path program 1 times [2025-03-08 00:53:11,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576191713] [2025-03-08 00:53:11,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 00:53:11,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 00:53:11,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:11,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 00:53:11,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576191713] [2025-03-08 00:53:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576191713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:11,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:11,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427327086] [2025-03-08 00:53:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:11,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:11,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:11,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:11,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:11,979 INFO L87 Difference]: Start difference. First operand 434 states and 603 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,000 INFO L93 Difference]: Finished difference Result 879 states and 1220 transitions. [2025-03-08 00:53:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 00:53:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,003 INFO L225 Difference]: With dead ends: 879 [2025-03-08 00:53:12,003 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 00:53:12,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,004 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 348 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 00:53:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-03-08 00:53:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3885209713024282) internal successors, (629), 453 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 629 transitions. [2025-03-08 00:53:12,018 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 629 transitions. Word has length 97 [2025-03-08 00:53:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 629 transitions. [2025-03-08 00:53:12,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,018 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 629 transitions. [2025-03-08 00:53:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 00:53:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:12,021 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:12,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:53:12,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1900686901, now seen corresponding path program 1 times [2025-03-08 00:53:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309821043] [2025-03-08 00:53:12,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:12,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:12,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 00:53:12,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 00:53:12,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:12,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 00:53:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:12,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309821043] [2025-03-08 00:53:12,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309821043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:12,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34923576] [2025-03-08 00:53:12,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:12,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,067 INFO L87 Difference]: Start difference. First operand 454 states and 629 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,085 INFO L93 Difference]: Finished difference Result 924 states and 1278 transitions. [2025-03-08 00:53:12,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 00:53:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,087 INFO L225 Difference]: With dead ends: 924 [2025-03-08 00:53:12,087 INFO L226 Difference]: Without dead ends: 479 [2025-03-08 00:53:12,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,087 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 20 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 321 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-08 00:53:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-03-08 00:53:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.3828451882845187) internal successors, (661), 478 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 661 transitions. [2025-03-08 00:53:12,098 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 661 transitions. Word has length 98 [2025-03-08 00:53:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,099 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 661 transitions. [2025-03-08 00:53:12,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 661 transitions. [2025-03-08 00:53:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 00:53:12,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:12,100 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:12,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:53:12,101 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:12,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2044934241, now seen corresponding path program 1 times [2025-03-08 00:53:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846024403] [2025-03-08 00:53:12,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:12,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 00:53:12,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 00:53:12,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:12,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 00:53:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846024403] [2025-03-08 00:53:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846024403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535301882] [2025-03-08 00:53:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:12,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:12,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:12,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,156 INFO L87 Difference]: Start difference. First operand 479 states and 661 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,189 INFO L93 Difference]: Finished difference Result 693 states and 960 transitions. [2025-03-08 00:53:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 00:53:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,192 INFO L225 Difference]: With dead ends: 693 [2025-03-08 00:53:12,192 INFO L226 Difference]: Without dead ends: 691 [2025-03-08 00:53:12,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,192 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 144 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 311 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-08 00:53:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-03-08 00:53:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.3884057971014492) internal successors, (958), 690 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 958 transitions. [2025-03-08 00:53:12,203 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 958 transitions. Word has length 99 [2025-03-08 00:53:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 958 transitions. [2025-03-08 00:53:12,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 958 transitions. [2025-03-08 00:53:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 00:53:12,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:12,205 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 00:53:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:53:12,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:12,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash -286329485, now seen corresponding path program 1 times [2025-03-08 00:53:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998912364] [2025-03-08 00:53:12,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:12,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 00:53:12,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 00:53:12,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:12,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 00:53:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998912364] [2025-03-08 00:53:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998912364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457405369] [2025-03-08 00:53:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:12,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:12,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:12,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,269 INFO L87 Difference]: Start difference. First operand 691 states and 958 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,373 INFO L93 Difference]: Finished difference Result 1471 states and 2102 transitions. [2025-03-08 00:53:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-03-08 00:53:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,376 INFO L225 Difference]: With dead ends: 1471 [2025-03-08 00:53:12,376 INFO L226 Difference]: Without dead ends: 811 [2025-03-08 00:53:12,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,377 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-08 00:53:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 805. [2025-03-08 00:53:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4228855721393034) internal successors, (1144), 804 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1144 transitions. [2025-03-08 00:53:12,397 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1144 transitions. Word has length 163 [2025-03-08 00:53:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1144 transitions. [2025-03-08 00:53:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1144 transitions. [2025-03-08 00:53:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 00:53:12,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:12,400 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:53:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:53:12,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:12,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2078229746, now seen corresponding path program 2 times [2025-03-08 00:53:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:12,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622500778] [2025-03-08 00:53:12,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:53:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:12,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-08 00:53:12,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 00:53:12,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:53:12,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 00:53:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622500778] [2025-03-08 00:53:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622500778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822519782] [2025-03-08 00:53:12,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:12,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:12,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:12,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,499 INFO L87 Difference]: Start difference. First operand 805 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,622 INFO L93 Difference]: Finished difference Result 1813 states and 2663 transitions. [2025-03-08 00:53:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2025-03-08 00:53:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,625 INFO L225 Difference]: With dead ends: 1813 [2025-03-08 00:53:12,625 INFO L226 Difference]: Without dead ends: 991 [2025-03-08 00:53:12,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,627 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 48 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 231 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-03-08 00:53:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2025-03-08 00:53:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.408308004052685) internal successors, (1390), 987 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1390 transitions. [2025-03-08 00:53:12,649 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1390 transitions. Word has length 174 [2025-03-08 00:53:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,649 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1390 transitions. [2025-03-08 00:53:12,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1390 transitions. [2025-03-08 00:53:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 00:53:12,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:12,651 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 00:53:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 00:53:12,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:12,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1090530269, now seen corresponding path program 1 times [2025-03-08 00:53:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:12,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387313336] [2025-03-08 00:53:12,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:12,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 00:53:12,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 00:53:12,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:12,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 00:53:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387313336] [2025-03-08 00:53:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387313336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928562574] [2025-03-08 00:53:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:12,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:12,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:12,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,736 INFO L87 Difference]: Start difference. First operand 988 states and 1390 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,765 INFO L93 Difference]: Finished difference Result 2274 states and 3199 transitions. [2025-03-08 00:53:12,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-03-08 00:53:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,770 INFO L225 Difference]: With dead ends: 2274 [2025-03-08 00:53:12,770 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 00:53:12,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,772 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 139 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 473 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 00:53:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1250. [2025-03-08 00:53:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.4123298638911128) internal successors, (1764), 1249 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1764 transitions. [2025-03-08 00:53:12,801 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1764 transitions. Word has length 185 [2025-03-08 00:53:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,801 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1764 transitions. [2025-03-08 00:53:12,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1764 transitions. [2025-03-08 00:53:12,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 00:53:12,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:12,804 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 00:53:12,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 00:53:12,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:12,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:12,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1868131243, now seen corresponding path program 1 times [2025-03-08 00:53:12,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:12,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109710779] [2025-03-08 00:53:12,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:12,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:12,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 00:53:12,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 00:53:12,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:12,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-08 00:53:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109710779] [2025-03-08 00:53:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109710779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47633813] [2025-03-08 00:53:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:12,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:12,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:12,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,895 INFO L87 Difference]: Start difference. First operand 1250 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:12,929 INFO L93 Difference]: Finished difference Result 2496 states and 3517 transitions. [2025-03-08 00:53:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:12,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-03-08 00:53:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:12,934 INFO L225 Difference]: With dead ends: 2496 [2025-03-08 00:53:12,935 INFO L226 Difference]: Without dead ends: 1542 [2025-03-08 00:53:12,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:12,937 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 133 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:12,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 469 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-03-08 00:53:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1518. [2025-03-08 00:53:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1517 states have (on average 1.4119973632168754) internal successors, (2142), 1517 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2142 transitions. [2025-03-08 00:53:12,975 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2142 transitions. Word has length 186 [2025-03-08 00:53:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:12,975 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2142 transitions. [2025-03-08 00:53:12,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:12,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2142 transitions. [2025-03-08 00:53:13,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 00:53:13,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:13,005 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:13,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 00:53:13,005 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:13,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 851830080, now seen corresponding path program 1 times [2025-03-08 00:53:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303032807] [2025-03-08 00:53:13,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 00:53:13,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 00:53:13,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:13,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 382 proven. 15 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-08 00:53:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303032807] [2025-03-08 00:53:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303032807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98307786] [2025-03-08 00:53:13,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:13,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:13,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:13,106 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 00:53:13,108 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 00:53:13,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 00:53:13,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 00:53:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:13,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:13,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-08 00:53:13,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98307786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:13,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:53:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 00:53:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314671688] [2025-03-08 00:53:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:53:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:13,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:53:13,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:53:13,340 INFO L87 Difference]: Start difference. First operand 1518 states and 2142 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:13,392 INFO L93 Difference]: Finished difference Result 3589 states and 5064 transitions. [2025-03-08 00:53:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:53:13,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2025-03-08 00:53:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:13,399 INFO L225 Difference]: With dead ends: 3589 [2025-03-08 00:53:13,399 INFO L226 Difference]: Without dead ends: 2367 [2025-03-08 00:53:13,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:53:13,402 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 390 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:13,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 645 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2025-03-08 00:53:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2270. [2025-03-08 00:53:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2269 states have (on average 1.4191273688849713) internal successors, (3220), 2269 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3220 transitions. [2025-03-08 00:53:13,445 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3220 transitions. Word has length 187 [2025-03-08 00:53:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:13,445 INFO L471 AbstractCegarLoop]: Abstraction has 2270 states and 3220 transitions. [2025-03-08 00:53:13,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3220 transitions. [2025-03-08 00:53:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 00:53:13,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:13,449 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:13,456 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 00:53:13,649 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,SelfDestructingSolverStorable14 [2025-03-08 00:53:13,650 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:13,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1313983455, now seen corresponding path program 1 times [2025-03-08 00:53:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:13,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385717997] [2025-03-08 00:53:13,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:13,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 00:53:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 00:53:13,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:13,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-03-08 00:53:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385717997] [2025-03-08 00:53:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385717997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457213925] [2025-03-08 00:53:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:13,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:13,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:13,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:13,759 INFO L87 Difference]: Start difference. First operand 2270 states and 3220 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:13,794 INFO L93 Difference]: Finished difference Result 3512 states and 4961 transitions. [2025-03-08 00:53:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-03-08 00:53:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:13,801 INFO L225 Difference]: With dead ends: 3512 [2025-03-08 00:53:13,801 INFO L226 Difference]: Without dead ends: 2558 [2025-03-08 00:53:13,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:13,803 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 111 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:13,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 481 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-08 00:53:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2025-03-08 00:53:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2557 states have (on average 1.416503715291357) internal successors, (3622), 2557 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3622 transitions. [2025-03-08 00:53:13,863 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3622 transitions. Word has length 188 [2025-03-08 00:53:13,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3622 transitions. [2025-03-08 00:53:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3622 transitions. [2025-03-08 00:53:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 00:53:13,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:13,868 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 00:53:13,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 00:53:13,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:13,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2075293157, now seen corresponding path program 1 times [2025-03-08 00:53:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94390004] [2025-03-08 00:53:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:13,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 00:53:13,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 00:53:13,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:53:13,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:53:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 00:53:13,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 00:53:13,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:13,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:53:13,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:53:13,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:53:13,975 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:53:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 00:53:13,978 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:14,115 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:53:14,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:53:14 BoogieIcfgContainer [2025-03-08 00:53:14,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:53:14,120 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:53:14,120 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:53:14,120 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:53:14,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:10" (3/4) ... [2025-03-08 00:53:14,122 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 00:53:14,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:53:14,123 INFO L158 Benchmark]: Toolchain (without parser) took 4557.68ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.3MB in the beginning and 217.5MB in the end (delta: -112.1MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-03-08 00:53:14,123 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:14,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.79ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 90.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:53:14,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.51ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:14,124 INFO L158 Benchmark]: Boogie Preprocessor took 38.97ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:14,124 INFO L158 Benchmark]: IcfgBuilder took 495.17ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 50.3MB in the end (delta: 35.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 00:53:14,124 INFO L158 Benchmark]: TraceAbstraction took 3764.84ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.3MB in the beginning and 217.5MB in the end (delta: -167.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2025-03-08 00:53:14,124 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 318.8MB. Free memory is still 217.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:14,125 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.79ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 90.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.51ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.97ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 495.17ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 50.3MB in the end (delta: 35.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3764.84ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 50.3MB in the beginning and 217.5MB in the end (delta: -167.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 318.8MB. Free memory is still 217.5MB. 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: 618]: 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 bitwiseOr at line 366. Possible FailurePath: [L627] int __retres1 ; [L631] CALL ssl3_connect() [L19] int s__info_callback = __VERIFIER_nondet_int(); [L20] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L21] int s__state ; [L22] int s__new_session ; [L23] int s__server ; [L24] unsigned int s__version = __VERIFIER_nondet_uint(); [L25] int s__type ; [L26] int s__init_num ; [L27] int s__bbio = __VERIFIER_nondet_int(); [L28] int s__wbio = __VERIFIER_nondet_int(); [L29] int s__hit = __VERIFIER_nondet_int(); [L30] int s__rwstate ; [L31] int s__init_buf___0 = __VERIFIER_nondet_int(); [L32] int s__debug = __VERIFIER_nondet_int(); [L33] int s__shutdown ; [L34] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L35] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L36] unsigned int s__ctx__stats__sess_connect = __VERIFIER_nondet_uint(); [L37] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L38] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L39] int s__s3__change_cipher_spec ; [L40] int s__s3__flags = __VERIFIER_nondet_int(); [L41] int s__s3__delay_buf_pop_ret ; [L42] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L43] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L44] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L45] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L46] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L47] int s__s3__tmp__next_state___0 ; [L48] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L49] int s__session__cipher ; [L50] int s__session__compress_meth ; [L51] int buf ; [L52] unsigned long tmp ; [L53] unsigned long l ; [L54] int num1 = __VERIFIER_nondet_int(); [L55] int cb ; [L56] int ret ; [L57] int new_state ; [L58] int state ; [L59] int skip ; [L60] int tmp___0 ; [L61] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L62] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L63] int tmp___3 = __VERIFIER_nondet_int(); [L64] int tmp___4 = __VERIFIER_nondet_int(); [L65] int tmp___5 = __VERIFIER_nondet_int(); [L66] int tmp___6 = __VERIFIER_nondet_int(); [L67] int tmp___7 = __VERIFIER_nondet_int(); [L68] int tmp___8 = __VERIFIER_nondet_int(); [L69] int tmp___9 = __VERIFIER_nondet_int(); [L70] int blastFlag ; [L71] int ag_X ; [L72] int ag_Y ; [L73] int __retres59 ; [L76] s__state = 12292 [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] tmp___0 = 0 VAL [blastFlag=0, cb=0, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__info_callback=1, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L92] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L93] COND FALSE !(tmp___1 - 12288) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND TRUE s__state == 12292 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L209] s__new_session = 1 [L210] s__state = 4096 [L211] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L216] s__server = 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L217] COND TRUE cb != 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L222] COND FALSE !(s__version - 65280 != 768) [L228] s__type = 4096 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L229] COND FALSE !(s__init_buf___0 == 0) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L247] COND FALSE !(! tmp___4) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L253] COND FALSE !(! tmp___5) [L259] s__state = 4368 [L260] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L261] s__init_num = 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND TRUE s__state == 4368 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND TRUE blastFlag == 0 [L268] blastFlag = 1 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L276] COND FALSE !(ret <= 0) [L281] s__state = 4384 [L282] s__init_num = 0 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L283] COND TRUE s__bbio != s__wbio VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4384 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L291] ret = __VERIFIER_nondet_int() VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L292] COND TRUE blastFlag == 1 [L293] blastFlag = 2 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L297] COND FALSE !(ret <= 0) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L302] COND FALSE !(\read(s__hit)) [L305] s__state = 4400 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L307] s__init_num = 0 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4400 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L311] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L314] ret = __VERIFIER_nondet_int() [L315] COND TRUE blastFlag == 2 [L316] blastFlag = 3 VAL [blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L320] COND FALSE !(ret <= 0) VAL [blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L326] ag_Y = 61087 [L327] s__state = 4416 [L328] s__init_num = 0 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND TRUE s__state == 4416 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L332] ret = __VERIFIER_nondet_int() VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L333] COND TRUE blastFlag == 3 [L334] blastFlag = 4 VAL [ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L338] COND FALSE !(ret <= 0) [L343] s__state = 4432 [L344] ag_X = (unsigned short)65535 [L345] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L346] COND FALSE !(! tmp___6) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4416) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4417) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND TRUE s__state == 4432 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L355] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L356] COND FALSE !(blastFlag == 5) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L361] COND FALSE !(ret <= 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L366] EXPR ag_X ^ ag_Y VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L366] s__state = ag_X ^ ag_Y [L367] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND TRUE s__state == 4368 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND FALSE !(blastFlag == 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L270] COND TRUE blastFlag == 4 [L271] blastFlag = 5 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L276] COND FALSE !(ret <= 0) [L281] s__state = 4384 [L282] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L283] COND TRUE s__bbio != s__wbio VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4384 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L291] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L292] COND FALSE !(blastFlag == 1) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L297] COND FALSE !(ret <= 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L302] COND FALSE !(\read(s__hit)) [L305] s__state = 4400 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L307] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4400 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L311] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L314] ret = __VERIFIER_nondet_int() [L315] COND FALSE !(blastFlag == 2) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L320] COND FALSE !(ret <= 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L326] ag_Y = 61087 [L327] s__state = 4416 [L328] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND TRUE s__state == 4416 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L332] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L333] COND FALSE !(blastFlag == 3) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L338] COND FALSE !(ret <= 0) [L343] s__state = 4432 [L344] ag_X = (unsigned short)65535 [L345] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L346] COND FALSE !(! tmp___6) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4416) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4417) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND TRUE s__state == 4432 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L355] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=0, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L356] COND TRUE blastFlag == 5 VAL [ag_X=65535, ag_Y=61087, cb=1, num1=0, ret=0, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L618] reach_error() VAL [ag_X=65535, ag_Y=61087, cb=1, num1=0, ret=0, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 219 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 17, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1258 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1258 mSDsluCounter, 5460 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2090 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 998 IncrementalHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 3370 mSDtfsCounter, 998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2558occurred in iteration=16, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 200 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2159 NumberOfCodeBlocks, 2159 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1952 ConstructedInterpolants, 0 QuantifiedInterpolants, 3300 SizeOfPredicates, 2 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 4225/4240 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 00:53:14,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -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 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:53:15,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:16,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 00:53:16,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:16,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:16,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:16,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:16,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:16,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:16,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:16,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:16,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:16,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:16,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:16,058 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:16,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:16,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:16,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:16,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:16,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:16,060 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 -> 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f [2025-03-08 00:53:16,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:16,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:16,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:16,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:16,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:16,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-03-08 00:53:17,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1461f9572/1e457f0edc924e5a95065b7302d5d375/FLAG3f5f59d4c [2025-03-08 00:53:17,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:17,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-03-08 00:53:17,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1461f9572/1e457f0edc924e5a95065b7302d5d375/FLAG3f5f59d4c [2025-03-08 00:53:18,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1461f9572/1e457f0edc924e5a95065b7302d5d375 [2025-03-08 00:53:18,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:18,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:18,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:18,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:18,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:18,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f715ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18, skipping insertion in model container [2025-03-08 00:53:18,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:18,186 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/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-03-08 00:53:18,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:18,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:18,228 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/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-03-08 00:53:18,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:18,242 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:18,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18 WrapperNode [2025-03-08 00:53:18,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:18,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:18,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:18,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:18,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,277 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 467 [2025-03-08 00:53:18,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:18,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:18,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:18,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:18,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,304 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 00:53:18,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:18,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:18,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:18,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:18,316 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (1/1) ... [2025-03-08 00:53:18,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:18,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:53:18,344 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 00:53:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 00:53:18,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:18,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:18,443 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:18,445 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:18,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume false; [2025-03-08 00:53:18,858 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume !false; [2025-03-08 00:53:18,889 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:18,889 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:18,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:18,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:53:18,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:18 BoogieIcfgContainer [2025-03-08 00:53:18,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:18,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:18,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:18,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:18,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:18" (1/3) ... [2025-03-08 00:53:18,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbe756d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:18, skipping insertion in model container [2025-03-08 00:53:18,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:18" (2/3) ... [2025-03-08 00:53:18,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbe756d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:18, skipping insertion in model container [2025-03-08 00:53:18,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:18" (3/3) ... [2025-03-08 00:53:18,917 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2025-03-08 00:53:18,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:18,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_2.BV.c.cil-1a.c that has 1 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:53:18,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:18,971 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;@3dd878e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:18,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7295081967213115) internal successors, (211), 123 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:53:18,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:18,983 INFO L218 NwaCegarLoop]: trace histogram [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 00:53:18,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -530100739, now seen corresponding path program 1 times [2025-03-08 00:53:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535050961] [2025-03-08 00:53:18,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:18,996 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 00:53:18,997 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 00:53:19,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:53:19,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:53:19,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:19,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:19,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:19,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:53:19,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:19,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535050961] [2025-03-08 00:53:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535050961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:19,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:19,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839693457] [2025-03-08 00:53:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:19,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:19,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:19,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:19,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:19,128 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7295081967213115) internal successors, (211), 123 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:19,238 INFO L93 Difference]: Finished difference Result 243 states and 415 transitions. [2025-03-08 00:53:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 00:53:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:19,244 INFO L225 Difference]: With dead ends: 243 [2025-03-08 00:53:19,244 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 00:53:19,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:19,250 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:19,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 317 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 00:53:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 00:53:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 109 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:19,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2025-03-08 00:53:19,280 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 23 [2025-03-08 00:53:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:19,281 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2025-03-08 00:53:19,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2025-03-08 00:53:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:53:19,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:19,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:19,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:53:19,482 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 [2025-03-08 00:53:19,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:19,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1940446315, now seen corresponding path program 1 times [2025-03-08 00:53:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:19,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2003638365] [2025-03-08 00:53:19,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:19,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:19,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:19,486 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 00:53:19,487 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 00:53:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:53:19,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:53:19,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:19,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:19,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:19,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:53:19,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:19,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003638365] [2025-03-08 00:53:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003638365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503685960] [2025-03-08 00:53:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:19,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:19,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:19,559 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:19,681 INFO L93 Difference]: Finished difference Result 225 states and 346 transitions. [2025-03-08 00:53:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 00:53:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:19,682 INFO L225 Difference]: With dead ends: 225 [2025-03-08 00:53:19,682 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 00:53:19,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:19,683 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:19,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 236 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 00:53:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-08 00:53:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.5121951219512195) internal successors, (186), 123 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 186 transitions. [2025-03-08 00:53:19,694 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 186 transitions. Word has length 34 [2025-03-08 00:53:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 186 transitions. [2025-03-08 00:53:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 186 transitions. [2025-03-08 00:53:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:53:19,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:19,696 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 00:53:19,702 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 00:53:19,896 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 [2025-03-08 00:53:19,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2133517978, now seen corresponding path program 1 times [2025-03-08 00:53:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722527907] [2025-03-08 00:53:19,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:19,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:19,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:19,899 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 00:53:19,900 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 00:53:19,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 00:53:19,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:53:19,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:19,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:19,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:19,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:53:19,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:19,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722527907] [2025-03-08 00:53:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722527907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544427525] [2025-03-08 00:53:19,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:19,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:19,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:19,987 INFO L87 Difference]: Start difference. First operand 124 states and 186 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:20,102 INFO L93 Difference]: Finished difference Result 255 states and 388 transitions. [2025-03-08 00:53:20,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:20,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-08 00:53:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:20,104 INFO L225 Difference]: With dead ends: 255 [2025-03-08 00:53:20,106 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 00:53:20,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:20,107 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:20,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 249 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 00:53:20,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-08 00:53:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4892086330935252) internal successors, (207), 139 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-03-08 00:53:20,117 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 47 [2025-03-08 00:53:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:20,120 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-03-08 00:53:20,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-03-08 00:53:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:53:20,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:20,122 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:20,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:53:20,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:20,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:20,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash 448625125, now seen corresponding path program 1 times [2025-03-08 00:53:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:20,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618700279] [2025-03-08 00:53:20,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:20,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:20,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:20,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:20,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:53:20,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 00:53:20,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:53:20,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:20,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:20,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:20,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:20,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:20,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618700279] [2025-03-08 00:53:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618700279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310605560] [2025-03-08 00:53:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:20,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:20,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:20,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:20,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:20,409 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:20,541 INFO L93 Difference]: Finished difference Result 310 states and 475 transitions. [2025-03-08 00:53:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 00:53:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:20,543 INFO L225 Difference]: With dead ends: 310 [2025-03-08 00:53:20,543 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 00:53:20,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:20,543 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 25 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:20,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 231 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 00:53:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-08 00:53:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 178 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2025-03-08 00:53:20,553 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 63 [2025-03-08 00:53:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:20,553 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2025-03-08 00:53:20,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2025-03-08 00:53:20,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 00:53:20,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:20,554 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:53:20,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:20,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1589431164, now seen corresponding path program 1 times [2025-03-08 00:53:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401313621] [2025-03-08 00:53:20,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:20,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:20,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:20,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:20,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:53:20,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 00:53:20,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 00:53:20,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:20,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:20,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:20,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:20,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:20,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401313621] [2025-03-08 00:53:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401313621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:20,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386536548] [2025-03-08 00:53:20,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:20,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:20,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:20,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:20,840 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:20,949 INFO L93 Difference]: Finished difference Result 367 states and 522 transitions. [2025-03-08 00:53:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:20,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 00:53:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:20,951 INFO L225 Difference]: With dead ends: 367 [2025-03-08 00:53:20,951 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 00:53:20,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:20,955 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:20,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 254 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 00:53:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 00:53:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.3979591836734695) internal successors, (274), 196 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 274 transitions. [2025-03-08 00:53:20,964 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 274 transitions. Word has length 63 [2025-03-08 00:53:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 274 transitions. [2025-03-08 00:53:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 274 transitions. [2025-03-08 00:53:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 00:53:20,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:20,965 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:20,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:53:21,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1509223802, now seen corresponding path program 1 times [2025-03-08 00:53:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:21,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53206225] [2025-03-08 00:53:21,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:21,169 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:21,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:53:21,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 00:53:21,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:53:21,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:21,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:53:21,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:21,259 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53206225] [2025-03-08 00:53:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53206225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347328940] [2025-03-08 00:53:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:21,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:21,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,260 INFO L87 Difference]: Start difference. First operand 197 states and 274 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:21,348 INFO L93 Difference]: Finished difference Result 405 states and 572 transitions. [2025-03-08 00:53:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-08 00:53:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:21,349 INFO L225 Difference]: With dead ends: 405 [2025-03-08 00:53:21,349 INFO L226 Difference]: Without dead ends: 217 [2025-03-08 00:53:21,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,350 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:21,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 253 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-08 00:53:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-08 00:53:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3842592592592593) internal successors, (299), 216 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 299 transitions. [2025-03-08 00:53:21,355 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 299 transitions. Word has length 78 [2025-03-08 00:53:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:21,356 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 299 transitions. [2025-03-08 00:53:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 299 transitions. [2025-03-08 00:53:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 00:53:21,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:21,358 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:21,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:53:21,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash -513331812, now seen corresponding path program 1 times [2025-03-08 00:53:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935238502] [2025-03-08 00:53:21,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:21,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:21,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:53:21,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 00:53:21,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 00:53:21,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:21,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:53:21,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:21,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:21,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935238502] [2025-03-08 00:53:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935238502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157430630] [2025-03-08 00:53:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:21,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:21,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:21,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,677 INFO L87 Difference]: Start difference. First operand 217 states and 299 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:21,704 INFO L93 Difference]: Finished difference Result 630 states and 869 transitions. [2025-03-08 00:53:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 00:53:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:21,706 INFO L225 Difference]: With dead ends: 630 [2025-03-08 00:53:21,707 INFO L226 Difference]: Without dead ends: 422 [2025-03-08 00:53:21,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,708 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 123 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:21,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 353 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-08 00:53:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2025-03-08 00:53:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 1.3705463182897861) internal successors, (577), 421 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 577 transitions. [2025-03-08 00:53:21,725 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 577 transitions. Word has length 97 [2025-03-08 00:53:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:21,726 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 577 transitions. [2025-03-08 00:53:21,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 577 transitions. [2025-03-08 00:53:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 00:53:21,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:21,727 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:21,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:53:21,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1851016379, now seen corresponding path program 1 times [2025-03-08 00:53:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244282235] [2025-03-08 00:53:21,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:21,937 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:21,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:53:21,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 00:53:21,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 00:53:21,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:21,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 00:53:22,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:22,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:22,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244282235] [2025-03-08 00:53:22,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244282235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947743649] [2025-03-08 00:53:22,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:22,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,016 INFO L87 Difference]: Start difference. First operand 422 states and 577 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,034 INFO L93 Difference]: Finished difference Result 855 states and 1168 transitions. [2025-03-08 00:53:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-08 00:53:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,037 INFO L225 Difference]: With dead ends: 855 [2025-03-08 00:53:22,037 INFO L226 Difference]: Without dead ends: 442 [2025-03-08 00:53:22,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,038 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 334 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-08 00:53:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-08 00:53:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.3673469387755102) internal successors, (603), 441 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 603 transitions. [2025-03-08 00:53:22,051 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 603 transitions. Word has length 97 [2025-03-08 00:53:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,051 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 603 transitions. [2025-03-08 00:53:22,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 603 transitions. [2025-03-08 00:53:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 00:53:22,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,063 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:22,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:53:22,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -685948420, now seen corresponding path program 1 times [2025-03-08 00:53:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:22,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644100607] [2025-03-08 00:53:22,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:22,266 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:22,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:53:22,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 00:53:22,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 00:53:22,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:22,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 00:53:22,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:22,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644100607] [2025-03-08 00:53:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644100607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583246148] [2025-03-08 00:53:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:22,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,356 INFO L87 Difference]: Start difference. First operand 442 states and 603 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,374 INFO L93 Difference]: Finished difference Result 900 states and 1226 transitions. [2025-03-08 00:53:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 00:53:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,376 INFO L225 Difference]: With dead ends: 900 [2025-03-08 00:53:22,376 INFO L226 Difference]: Without dead ends: 467 [2025-03-08 00:53:22,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,377 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 20 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 307 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-08 00:53:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-08 00:53:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.3626609442060085) internal successors, (635), 466 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 635 transitions. [2025-03-08 00:53:22,386 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 635 transitions. Word has length 98 [2025-03-08 00:53:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,386 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 635 transitions. [2025-03-08 00:53:22,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 635 transitions. [2025-03-08 00:53:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 00:53:22,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,387 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:22,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:53:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1325309919, now seen corresponding path program 1 times [2025-03-08 00:53:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018690093] [2025-03-08 00:53:22,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:22,590 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:22,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:53:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 00:53:22,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 00:53:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:22,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 00:53:22,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:22,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018690093] [2025-03-08 00:53:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018690093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492378689] [2025-03-08 00:53:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:22,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,679 INFO L87 Difference]: Start difference. First operand 467 states and 635 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,705 INFO L93 Difference]: Finished difference Result 1088 states and 1486 transitions. [2025-03-08 00:53:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 00:53:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,707 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 00:53:22,707 INFO L226 Difference]: Without dead ends: 655 [2025-03-08 00:53:22,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,708 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 123 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 453 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-08 00:53:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-03-08 00:53:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.3608562691131498) internal successors, (890), 654 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 890 transitions. [2025-03-08 00:53:22,719 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 890 transitions. Word has length 99 [2025-03-08 00:53:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,719 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 890 transitions. [2025-03-08 00:53:22,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 890 transitions. [2025-03-08 00:53:22,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 00:53:22,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,720 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:22,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:53:22,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,921 INFO L85 PathProgramCache]: Analyzing trace with hash -80545438, now seen corresponding path program 1 times [2025-03-08 00:53:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:22,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230754802] [2025-03-08 00:53:22,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:22,923 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:22,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:53:22,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 00:53:22,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 00:53:22,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:22,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:53:23,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:23,010 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230754802] [2025-03-08 00:53:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230754802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622806748] [2025-03-08 00:53:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:23,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,011 INFO L87 Difference]: Start difference. First operand 655 states and 890 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,031 INFO L93 Difference]: Finished difference Result 1300 states and 1765 transitions. [2025-03-08 00:53:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-08 00:53:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,035 INFO L225 Difference]: With dead ends: 1300 [2025-03-08 00:53:23,035 INFO L226 Difference]: Without dead ends: 679 [2025-03-08 00:53:23,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,036 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-08 00:53:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-03-08 00:53:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.3554572271386431) internal successors, (919), 678 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 919 transitions. [2025-03-08 00:53:23,048 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 919 transitions. Word has length 99 [2025-03-08 00:53:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,049 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 919 transitions. [2025-03-08 00:53:23,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 919 transitions. [2025-03-08 00:53:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 00:53:23,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,050 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 00:53:23,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:53:23,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:23,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -550588685, now seen corresponding path program 1 times [2025-03-08 00:53:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [878973764] [2025-03-08 00:53:23,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:23,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:23,256 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:23,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:53:23,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 00:53:23,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 00:53:23,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:23,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 00:53:23,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:23,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878973764] [2025-03-08 00:53:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878973764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852983129] [2025-03-08 00:53:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:23,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,394 INFO L87 Difference]: Start difference. First operand 679 states and 919 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,410 INFO L93 Difference]: Finished difference Result 1527 states and 2070 transitions. [2025-03-08 00:53:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2025-03-08 00:53:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,413 INFO L225 Difference]: With dead ends: 1527 [2025-03-08 00:53:23,413 INFO L226 Difference]: Without dead ends: 882 [2025-03-08 00:53:23,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,414 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 117 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 463 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-08 00:53:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-03-08 00:53:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.3541430192962542) internal successors, (1193), 881 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1193 transitions. [2025-03-08 00:53:23,429 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1193 transitions. Word has length 163 [2025-03-08 00:53:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,429 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1193 transitions. [2025-03-08 00:53:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1193 transitions. [2025-03-08 00:53:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 00:53:23,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,431 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 00:53:23,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:53:23,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:23,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 676620567, now seen corresponding path program 1 times [2025-03-08 00:53:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106007969] [2025-03-08 00:53:23,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:23,637 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:23,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:53:23,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 00:53:23,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 00:53:23,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:23,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 00:53:23,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:23,725 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106007969] [2025-03-08 00:53:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106007969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463033926] [2025-03-08 00:53:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:23,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,727 INFO L87 Difference]: Start difference. First operand 882 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,825 INFO L93 Difference]: Finished difference Result 1798 states and 2479 transitions. [2025-03-08 00:53:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-08 00:53:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,828 INFO L225 Difference]: With dead ends: 1798 [2025-03-08 00:53:23,828 INFO L226 Difference]: Without dead ends: 970 [2025-03-08 00:53:23,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,830 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 17 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 252 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-03-08 00:53:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2025-03-08 00:53:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.3426212590299278) internal successors, (1301), 969 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1301 transitions. [2025-03-08 00:53:23,846 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1301 transitions. Word has length 165 [2025-03-08 00:53:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,846 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1301 transitions. [2025-03-08 00:53:23,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1301 transitions. [2025-03-08 00:53:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 00:53:23,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,849 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 00:53:23,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 00:53:24,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:24,050 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:24,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1406221720, now seen corresponding path program 1 times [2025-03-08 00:53:24,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:24,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [93517785] [2025-03-08 00:53:24,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:24,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:24,053 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:24,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:53:24,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 00:53:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 00:53:24,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:24,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:24,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:53:24,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 417 proven. 18 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-08 00:53:24,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 402 proven. 33 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-08 00:53:24,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93517785] [2025-03-08 00:53:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93517785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:24,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:53:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 00:53:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391531289] [2025-03-08 00:53:24,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:53:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:24,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:53:24,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:53:24,334 INFO L87 Difference]: Start difference. First operand 970 states and 1301 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:24,715 INFO L93 Difference]: Finished difference Result 2307 states and 3174 transitions. [2025-03-08 00:53:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2025-03-08 00:53:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:24,719 INFO L225 Difference]: With dead ends: 2307 [2025-03-08 00:53:24,719 INFO L226 Difference]: Without dead ends: 1391 [2025-03-08 00:53:24,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:53:24,721 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 387 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:24,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 722 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-08 00:53:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1321. [2025-03-08 00:53:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.3553030303030302) internal successors, (1789), 1320 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1789 transitions. [2025-03-08 00:53:24,745 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1789 transitions. Word has length 185 [2025-03-08 00:53:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:24,745 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1789 transitions. [2025-03-08 00:53:24,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1789 transitions. [2025-03-08 00:53:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 00:53:24,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:24,748 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:24,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:24,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:24,952 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash 631117769, now seen corresponding path program 1 times [2025-03-08 00:53:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822663587] [2025-03-08 00:53:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:24,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:24,954 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:24,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:53:25,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 00:53:25,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 00:53:25,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:25,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-08 00:53:25,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:25,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:25,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822663587] [2025-03-08 00:53:25,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822663587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:25,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:25,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284339335] [2025-03-08 00:53:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:25,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:25,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:25,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,050 INFO L87 Difference]: Start difference. First operand 1321 states and 1789 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:25,165 INFO L93 Difference]: Finished difference Result 2723 states and 3752 transitions. [2025-03-08 00:53:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-08 00:53:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:25,170 INFO L225 Difference]: With dead ends: 2723 [2025-03-08 00:53:25,170 INFO L226 Difference]: Without dead ends: 1456 [2025-03-08 00:53:25,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,172 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:25,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 254 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-08 00:53:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2025-03-08 00:53:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1455 states have (on average 1.3395189003436425) internal successors, (1949), 1455 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1949 transitions. [2025-03-08 00:53:25,199 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1949 transitions. Word has length 209 [2025-03-08 00:53:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:25,199 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1949 transitions. [2025-03-08 00:53:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1949 transitions. [2025-03-08 00:53:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 00:53:25,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:25,202 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:25,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:53:25,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:25,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:25,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash 245750986, now seen corresponding path program 1 times [2025-03-08 00:53:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:25,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714948235] [2025-03-08 00:53:25,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:25,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:25,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:25,405 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:25,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:53:25,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 00:53:25,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 00:53:25,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:25,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-08 00:53:25,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:25,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:25,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714948235] [2025-03-08 00:53:25,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714948235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:25,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:25,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823027296] [2025-03-08 00:53:25,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:25,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:25,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:25,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,499 INFO L87 Difference]: Start difference. First operand 1456 states and 1949 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:25,618 INFO L93 Difference]: Finished difference Result 3008 states and 4107 transitions. [2025-03-08 00:53:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-08 00:53:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:25,622 INFO L225 Difference]: With dead ends: 3008 [2025-03-08 00:53:25,622 INFO L226 Difference]: Without dead ends: 1606 [2025-03-08 00:53:25,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,624 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:25,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 255 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-08 00:53:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-08 00:53:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.3233644859813085) internal successors, (2124), 1605 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2124 transitions. [2025-03-08 00:53:25,651 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2124 transitions. Word has length 209 [2025-03-08 00:53:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:25,651 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2124 transitions. [2025-03-08 00:53:25,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2124 transitions. [2025-03-08 00:53:25,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-08 00:53:25,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:25,654 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:25,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 00:53:25,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:25,854 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:25,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:25,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1127955693, now seen corresponding path program 1 times [2025-03-08 00:53:25,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:25,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716274246] [2025-03-08 00:53:25,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:25,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:25,857 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:25,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:53:25,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 00:53:25,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 00:53:25,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:25,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:25,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:25,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-08 00:53:25,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:25,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:25,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716274246] [2025-03-08 00:53:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716274246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:25,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112974160] [2025-03-08 00:53:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:25,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:25,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:25,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:25,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:25,965 INFO L87 Difference]: Start difference. First operand 1606 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:26,006 INFO L93 Difference]: Finished difference Result 4570 states and 6065 transitions. [2025-03-08 00:53:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:26,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-08 00:53:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:26,014 INFO L225 Difference]: With dead ends: 4570 [2025-03-08 00:53:26,015 INFO L226 Difference]: Without dead ends: 3018 [2025-03-08 00:53:26,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:26,017 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 123 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:26,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 471 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-03-08 00:53:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2025-03-08 00:53:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3016 states, 3015 states have (on average 1.3270315091210614) internal successors, (4001), 3015 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 4001 transitions. [2025-03-08 00:53:26,097 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 4001 transitions. Word has length 238 [2025-03-08 00:53:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:26,098 INFO L471 AbstractCegarLoop]: Abstraction has 3016 states and 4001 transitions. [2025-03-08 00:53:26,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 4001 transitions. [2025-03-08 00:53:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-08 00:53:26,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:26,102 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:26,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:53:26,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:26,303 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:26,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash 742588910, now seen corresponding path program 1 times [2025-03-08 00:53:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378880787] [2025-03-08 00:53:26,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:26,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:26,306 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:26,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:53:26,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 00:53:26,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 00:53:26,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:26,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:26,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-03-08 00:53:26,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:26,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378880787] [2025-03-08 00:53:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378880787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136337968] [2025-03-08 00:53:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:26,403 INFO L87 Difference]: Start difference. First operand 3016 states and 4001 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:26,539 INFO L93 Difference]: Finished difference Result 6333 states and 8586 transitions. [2025-03-08 00:53:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:26,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-03-08 00:53:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:26,548 INFO L225 Difference]: With dead ends: 6333 [2025-03-08 00:53:26,548 INFO L226 Difference]: Without dead ends: 3371 [2025-03-08 00:53:26,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:26,552 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 29 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:26,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 254 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2025-03-08 00:53:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3371. [2025-03-08 00:53:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3371 states, 3370 states have (on average 1.3074183976261127) internal successors, (4406), 3370 states have internal predecessors, (4406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 4406 transitions. [2025-03-08 00:53:26,618 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 4406 transitions. Word has length 238 [2025-03-08 00:53:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:26,618 INFO L471 AbstractCegarLoop]: Abstraction has 3371 states and 4406 transitions. [2025-03-08 00:53:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 4406 transitions. [2025-03-08 00:53:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 00:53:26,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:26,623 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:26,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:53:26,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:26,824 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1202070098, now seen corresponding path program 1 times [2025-03-08 00:53:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [74639224] [2025-03-08 00:53:26,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:26,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:26,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:26,827 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:26,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:53:26,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 00:53:26,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 00:53:26,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:26,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:26,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:26,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-08 00:53:26,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:26,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74639224] [2025-03-08 00:53:26,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74639224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:26,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:26,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132702959] [2025-03-08 00:53:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:26,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:26,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:26,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:26,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:26,926 INFO L87 Difference]: Start difference. First operand 3371 states and 4406 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:27,076 INFO L93 Difference]: Finished difference Result 6848 states and 9041 transitions. [2025-03-08 00:53:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:27,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-08 00:53:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:27,086 INFO L225 Difference]: With dead ends: 6848 [2025-03-08 00:53:27,086 INFO L226 Difference]: Without dead ends: 3531 [2025-03-08 00:53:27,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:27,090 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:27,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 254 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2025-03-08 00:53:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3531. [2025-03-08 00:53:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3531 states, 3530 states have (on average 1.3005665722379602) internal successors, (4591), 3530 states have internal predecessors, (4591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 4591 transitions. [2025-03-08 00:53:27,159 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 4591 transitions. Word has length 261 [2025-03-08 00:53:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:27,159 INFO L471 AbstractCegarLoop]: Abstraction has 3531 states and 4591 transitions. [2025-03-08 00:53:27,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 4591 transitions. [2025-03-08 00:53:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 00:53:27,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:27,163 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:27,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 00:53:27,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:27,367 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1760004351, now seen corresponding path program 1 times [2025-03-08 00:53:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:27,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454559593] [2025-03-08 00:53:27,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:27,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:27,370 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:27,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:53:27,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 00:53:27,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 00:53:27,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:27,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:27,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:27,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1014 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-08 00:53:27,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:27,469 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454559593] [2025-03-08 00:53:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454559593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:27,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214767690] [2025-03-08 00:53:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:27,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:27,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:27,470 INFO L87 Difference]: Start difference. First operand 3531 states and 4591 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:27,616 INFO L93 Difference]: Finished difference Result 7368 states and 9791 transitions. [2025-03-08 00:53:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-03-08 00:53:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:27,626 INFO L225 Difference]: With dead ends: 7368 [2025-03-08 00:53:27,626 INFO L226 Difference]: Without dead ends: 3891 [2025-03-08 00:53:27,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:27,629 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 31 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:27,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 250 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-03-08 00:53:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3891. [2025-03-08 00:53:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3890 states have (on average 1.2856041131105398) internal successors, (5001), 3890 states have internal predecessors, (5001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5001 transitions. [2025-03-08 00:53:27,717 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5001 transitions. Word has length 272 [2025-03-08 00:53:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:27,717 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 5001 transitions. [2025-03-08 00:53:27,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5001 transitions. [2025-03-08 00:53:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 00:53:27,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:27,725 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 13, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:27,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:53:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:27,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:27,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1146506207, now seen corresponding path program 1 times [2025-03-08 00:53:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [134434498] [2025-03-08 00:53:27,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:27,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:27,929 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:27,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:53:27,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 00:53:28,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 00:53:28,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:28,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:28,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:28,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-08 00:53:28,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:28,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134434498] [2025-03-08 00:53:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134434498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:28,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:28,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:28,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548685835] [2025-03-08 00:53:28,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:28,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:28,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:28,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:28,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:28,052 INFO L87 Difference]: Start difference. First operand 3891 states and 5001 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:28,211 INFO L93 Difference]: Finished difference Result 8138 states and 10691 transitions. [2025-03-08 00:53:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2025-03-08 00:53:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:28,223 INFO L225 Difference]: With dead ends: 8138 [2025-03-08 00:53:28,223 INFO L226 Difference]: Without dead ends: 4301 [2025-03-08 00:53:28,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:28,228 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 36 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:28,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 251 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2025-03-08 00:53:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4291. [2025-03-08 00:53:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4291 states, 4290 states have (on average 1.2706293706293705) internal successors, (5451), 4290 states have internal predecessors, (5451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 5451 transitions. [2025-03-08 00:53:28,325 INFO L78 Accepts]: Start accepts. Automaton has 4291 states and 5451 transitions. Word has length 307 [2025-03-08 00:53:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:28,325 INFO L471 AbstractCegarLoop]: Abstraction has 4291 states and 5451 transitions. [2025-03-08 00:53:28,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4291 states and 5451 transitions. [2025-03-08 00:53:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 00:53:28,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:28,331 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 13, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:28,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:53:28,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:28,532 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:28,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1337223967, now seen corresponding path program 1 times [2025-03-08 00:53:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:28,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987930474] [2025-03-08 00:53:28,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:28,535 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:28,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:53:28,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 00:53:28,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 00:53:28,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:28,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:28,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:28,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-08 00:53:28,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:28,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:28,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987930474] [2025-03-08 00:53:28,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987930474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:28,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331481029] [2025-03-08 00:53:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:28,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:28,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:28,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:28,790 INFO L87 Difference]: Start difference. First operand 4291 states and 5451 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:28,841 INFO L93 Difference]: Finished difference Result 12183 states and 15529 transitions. [2025-03-08 00:53:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2025-03-08 00:53:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:28,864 INFO L225 Difference]: With dead ends: 12183 [2025-03-08 00:53:28,864 INFO L226 Difference]: Without dead ends: 7946 [2025-03-08 00:53:28,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:28,870 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:28,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 398 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2025-03-08 00:53:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7848. [2025-03-08 00:53:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7848 states, 7847 states have (on average 1.2738626226583407) internal successors, (9996), 7847 states have internal predecessors, (9996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7848 states to 7848 states and 9996 transitions. [2025-03-08 00:53:29,003 INFO L78 Accepts]: Start accepts. Automaton has 7848 states and 9996 transitions. Word has length 308 [2025-03-08 00:53:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:29,003 INFO L471 AbstractCegarLoop]: Abstraction has 7848 states and 9996 transitions. [2025-03-08 00:53:29,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 7848 states and 9996 transitions. [2025-03-08 00:53:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 00:53:29,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:29,011 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:29,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:29,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:29,211 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 701925161, now seen corresponding path program 1 times [2025-03-08 00:53:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2032555660] [2025-03-08 00:53:29,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:29,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:29,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:29,214 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:29,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:53:29,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 00:53:29,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 00:53:29,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:29,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 837 proven. 9 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-08 00:53:29,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 837 proven. 9 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-08 00:53:29,435 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:29,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032555660] [2025-03-08 00:53:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032555660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:29,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:53:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 00:53:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23801350] [2025-03-08 00:53:29,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:29,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:29,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:29,436 INFO L87 Difference]: Start difference. First operand 7848 states and 9996 transitions. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:29,995 INFO L93 Difference]: Finished difference Result 20594 states and 26408 transitions. [2025-03-08 00:53:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:53:29,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-03-08 00:53:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:30,017 INFO L225 Difference]: With dead ends: 20594 [2025-03-08 00:53:30,017 INFO L226 Difference]: Without dead ends: 12800 [2025-03-08 00:53:30,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:53:30,022 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 370 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:30,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 845 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:53:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12800 states. [2025-03-08 00:53:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12800 to 8694. [2025-03-08 00:53:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8694 states, 8693 states have (on average 1.2845968020246175) internal successors, (11167), 8693 states have internal predecessors, (11167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8694 states to 8694 states and 11167 transitions. [2025-03-08 00:53:30,190 INFO L78 Accepts]: Start accepts. Automaton has 8694 states and 11167 transitions. Word has length 343 [2025-03-08 00:53:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:30,190 INFO L471 AbstractCegarLoop]: Abstraction has 8694 states and 11167 transitions. [2025-03-08 00:53:30,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8694 states and 11167 transitions. [2025-03-08 00:53:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-08 00:53:30,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:30,198 INFO L218 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:30,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 00:53:30,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:30,398 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1705430951, now seen corresponding path program 1 times [2025-03-08 00:53:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899593293] [2025-03-08 00:53:30,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:30,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:30,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:30,403 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:30,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:53:30,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-08 00:53:30,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-08 00:53:30,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:30,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:30,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:30,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-08 00:53:30,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:30,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:30,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899593293] [2025-03-08 00:53:30,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899593293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:30,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559237266] [2025-03-08 00:53:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:30,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:30,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:30,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:30,517 INFO L87 Difference]: Start difference. First operand 8694 states and 11167 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:30,691 INFO L93 Difference]: Finished difference Result 16315 states and 21278 transitions. [2025-03-08 00:53:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:30,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-03-08 00:53:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:30,698 INFO L225 Difference]: With dead ends: 16315 [2025-03-08 00:53:30,698 INFO L226 Difference]: Without dead ends: 4193 [2025-03-08 00:53:30,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:30,706 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:30,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 254 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2025-03-08 00:53:30,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4078. [2025-03-08 00:53:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4078 states, 4077 states have (on average 1.2477311748834927) internal successors, (5087), 4077 states have internal predecessors, (5087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 5087 transitions. [2025-03-08 00:53:30,753 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 5087 transitions. Word has length 381 [2025-03-08 00:53:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:30,754 INFO L471 AbstractCegarLoop]: Abstraction has 4078 states and 5087 transitions. [2025-03-08 00:53:30,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 5087 transitions. [2025-03-08 00:53:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-08 00:53:30,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:30,759 INFO L218 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:30,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:30,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:30,961 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 66572402, now seen corresponding path program 1 times [2025-03-08 00:53:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501581924] [2025-03-08 00:53:30,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:30,964 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:30,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:53:31,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-08 00:53:31,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-08 00:53:31,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:31,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:31,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:31,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 987 proven. 0 refuted. 0 times theorem prover too weak. 1738 trivial. 0 not checked. [2025-03-08 00:53:31,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:31,396 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501581924] [2025-03-08 00:53:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501581924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:31,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:31,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961633880] [2025-03-08 00:53:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:31,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:31,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:31,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:31,398 INFO L87 Difference]: Start difference. First operand 4078 states and 5087 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:31,421 INFO L93 Difference]: Finished difference Result 4082 states and 5090 transitions. [2025-03-08 00:53:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:31,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 489 [2025-03-08 00:53:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:31,427 INFO L225 Difference]: With dead ends: 4082 [2025-03-08 00:53:31,428 INFO L226 Difference]: Without dead ends: 4009 [2025-03-08 00:53:31,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:31,429 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:31,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2025-03-08 00:53:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4007. [2025-03-08 00:53:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 4006 states have (on average 1.2478781827259111) internal successors, (4999), 4006 states have internal predecessors, (4999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 4999 transitions. [2025-03-08 00:53:31,469 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 4999 transitions. Word has length 489 [2025-03-08 00:53:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 4999 transitions. [2025-03-08 00:53:31,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 4999 transitions. [2025-03-08 00:53:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-08 00:53:31,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:31,475 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:31,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 00:53:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:31,676 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1664205375, now seen corresponding path program 1 times [2025-03-08 00:53:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2030115263] [2025-03-08 00:53:31,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:31,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:31,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:31,679 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:31,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:53:31,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-08 00:53:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-08 00:53:31,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:31,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:31,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3920 backedges. 2011 proven. 13 refuted. 0 times theorem prover too weak. 1896 trivial. 0 not checked. [2025-03-08 00:53:31,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3920 backedges. 2011 proven. 13 refuted. 0 times theorem prover too weak. 1896 trivial. 0 not checked. [2025-03-08 00:53:31,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:31,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030115263] [2025-03-08 00:53:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030115263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:31,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:53:31,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 00:53:31,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155038229] [2025-03-08 00:53:31,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:31,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:31,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:31,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:31,924 INFO L87 Difference]: Start difference. First operand 4007 states and 4999 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:32,104 INFO L93 Difference]: Finished difference Result 4215 states and 5264 transitions. [2025-03-08 00:53:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:53:32,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2025-03-08 00:53:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:32,106 INFO L225 Difference]: With dead ends: 4215 [2025-03-08 00:53:32,106 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:53:32,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1196 GetRequests, 1190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:53:32,108 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 95 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:32,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 249 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:53:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:53:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:53:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:53:32,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 597 [2025-03-08 00:53:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:32,111 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:53:32,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:53:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:53:32,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:53:32,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:53:32,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 00:53:32,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:32,316 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 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 00:53:32,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:53:34,511 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:53:34,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:53:34 BoogieIcfgContainer [2025-03-08 00:53:34,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:53:34,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:53:34,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:53:34,536 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:53:34,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:18" (3/4) ... [2025-03-08 00:53:34,541 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:53:34,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-08 00:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:53:34,553 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:53:34,637 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:53:34,637 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:53:34,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:53:34,638 INFO L158 Benchmark]: Toolchain (without parser) took 16616.98ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 91.5MB in the beginning and 135.4MB in the end (delta: -44.0MB). Peak memory consumption was 261.5MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,638 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:34,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.43ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 75.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:34,638 INFO L158 Benchmark]: Boogie Preprocessor took 37.09ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:34,639 INFO L158 Benchmark]: IcfgBuilder took 585.70ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 37.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,639 INFO L158 Benchmark]: TraceAbstraction took 15632.64ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 36.8MB in the beginning and 143.8MB in the end (delta: -107.0MB). Peak memory consumption was 243.0MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,639 INFO L158 Benchmark]: Witness Printer took 101.28ms. Allocated memory is still 427.8MB. Free memory was 143.8MB in the beginning and 135.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,640 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.14ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.43ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 75.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 117.4MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.09ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 585.70ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 37.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15632.64ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 36.8MB in the beginning and 143.8MB in the end (delta: -107.0MB). Peak memory consumption was 243.0MB. Max. memory is 16.1GB. * Witness Printer took 101.28ms. Allocated memory is still 427.8MB. Free memory was 143.8MB in the beginning and 135.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 618]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 211 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 26, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1808 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1808 mSDsluCounter, 8755 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3639 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3188 IncrementalHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 5116 mSDtfsCounter, 3188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6277 GetRequests, 6231 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8694occurred in iteration=23, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 4403 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5163 NumberOfCodeBlocks, 5163 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6259 ConstructedInterpolants, 0 QuantifiedInterpolants, 9422 SizeOfPredicates, 4 NumberOfNonLiveVariables, 6286 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 25288/25383 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 103]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (4400 == s__state)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag)) && (4368 != s__s3__tmp__next_state___0)) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (4560 == s__state)) && (65535 == ag_X)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit))) || ((((61087 == ag_Y) && (65535 == ag_X)) && (4512 == s__state)) && (2 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4512 == s__state)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0))) || ((((((4432 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag))) || ((((61087 == ag_Y) && (65535 == ag_X)) && (4528 == s__state)) && (2 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4528 == s__state)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0))) || (((2 == blastFlag) && (0 == s__hit)) && (3 == s__state))) || (((((61087 == ag_Y) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit)) && (4464 == s__state))) || (((4512 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || (((((61087 == ag_Y) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit)) && (4480 == s__state))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4480 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag)) && (4480 == s__state))) || (((4560 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (4352 == s__state))) || ((((2 == blastFlag) && (0 != s__hit)) && (4352 == s__state)) && (3 == s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag)) && (4496 == s__state))) || (((2 == blastFlag) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0)) && (4496 == s__state))) || (((((4448 == s__state) && (61087 == ag_Y)) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit))) || (((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (0 == s__hit)) && (3 == blastFlag)) && (4416 == s__state))) || (((4400 == s__state) && (2 == blastFlag)) && (0 == s__hit))) || ((4384 == s__state) && (1 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4464 == s__state)) && (4 == blastFlag))) || (((((61087 == ag_Y) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit)) && (4496 == s__state))) || ((((((4448 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4464 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((0 == blastFlag) && (12292 == s__state))) || (((4560 == s__state) && (4560 == s__s3__tmp__next_state___0)) && (2 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4512 == s__state)) && (0 == s__hit)) && (4 == blastFlag))) || (((((4432 == s__state) && (61087 == ag_Y)) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4416 == s__state)) && (4 == blastFlag)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4528 == s__state)) && (0 == s__hit)) && (4 == blastFlag))) || (((4528 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || (((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((61087 == ag_Y) && (2 == blastFlag)) && (0 == s__hit)) && (4416 == s__state))) || ((4368 == s__state) && (0 == blastFlag))) || ((((4560 == s__s3__tmp__next_state___0) && (2 == blastFlag)) && (0 == s__hit)) && (4352 == s__state))) || ((((((4448 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:53:34,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE