./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.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_3.BV.c.cil-2a.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 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:53:17,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:17,767 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:17,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:17,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:17,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:17,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:17,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:17,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:17,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:17,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:17,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:17,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:17,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:17,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:17,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:17,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:17,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:17,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:17,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:17,799 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 -> 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 [2025-03-08 00:53:18,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:18,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:18,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:18,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:18,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:18,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2025-03-08 00:53:19,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e445b9c/a201778ce5464c1886de89351045c533/FLAG56af6e95b [2025-03-08 00:53:19,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:19,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2025-03-08 00:53:19,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e445b9c/a201778ce5464c1886de89351045c533/FLAG56af6e95b [2025-03-08 00:53:19,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e445b9c/a201778ce5464c1886de89351045c533 [2025-03-08 00:53:19,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:19,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:19,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:19,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:19,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:19,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:19" (1/1) ... [2025-03-08 00:53:19,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be41b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:19, skipping insertion in model container [2025-03-08 00:53:19,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:19" (1/1) ... [2025-03-08 00:53:19,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:19,979 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_3.BV.c.cil-2a.c[37884,37897] [2025-03-08 00:53:19,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:19,996 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:20,043 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_3.BV.c.cil-2a.c[37884,37897] [2025-03-08 00:53:20,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:20,058 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:20,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20 WrapperNode [2025-03-08 00:53:20,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:20,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:20,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:20,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:20,064 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:20" (1/1) ... [2025-03-08 00:53:20,070 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:20" (1/1) ... [2025-03-08 00:53:20,098 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 525 [2025-03-08 00:53:20,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:20,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:20,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:20,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:20,109 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:20" (1/1) ... [2025-03-08 00:53:20,110 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:20" (1/1) ... [2025-03-08 00:53:20,111 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:20" (1/1) ... [2025-03-08 00:53:20,129 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:20,130 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:20" (1/1) ... [2025-03-08 00:53:20,131 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:20" (1/1) ... [2025-03-08 00:53:20,137 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:20" (1/1) ... [2025-03-08 00:53:20,141 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:20" (1/1) ... [2025-03-08 00:53:20,142 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:20" (1/1) ... [2025-03-08 00:53:20,143 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:20" (1/1) ... [2025-03-08 00:53:20,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:20,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:20,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:20,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:20,145 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (1/1) ... [2025-03-08 00:53:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:20,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:20,169 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:20,171 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:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:53:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:20,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:20,246 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:20,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:20,615 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume false; [2025-03-08 00:53:20,616 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume !false; [2025-03-08 00:53:20,643 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:20,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:20,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:20,663 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:53:20,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:20 BoogieIcfgContainer [2025-03-08 00:53:20,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:20,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:20,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:20,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:20,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:19" (1/3) ... [2025-03-08 00:53:20,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40855226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:20, skipping insertion in model container [2025-03-08 00:53:20,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:20" (2/3) ... [2025-03-08 00:53:20,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40855226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:20, skipping insertion in model container [2025-03-08 00:53:20,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:20" (3/3) ... [2025-03-08 00:53:20,673 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2025-03-08 00:53:20,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:20,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_3.BV.c.cil-2a.c that has 1 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:53:20,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:20,742 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;@4940f4bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:20,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 1.717557251908397) internal successors, (225), 132 states have internal predecessors, (225), 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,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:53:20,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:20,751 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, 1] [2025-03-08 00:53:20,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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 -2075238570, now seen corresponding path program 1 times [2025-03-08 00:53:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423432117] [2025-03-08 00:53:20,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:20,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:53:20,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:53:20,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:20,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:20,932 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:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423432117] [2025-03-08 00:53:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423432117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327054027] [2025-03-08 00:53:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:20,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:20,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:20,949 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 1.717557251908397) internal successors, (225), 132 states have internal predecessors, (225), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:21,082 INFO L93 Difference]: Finished difference Result 260 states and 441 transitions. [2025-03-08 00:53:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-03-08 00:53:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:21,090 INFO L225 Difference]: With dead ends: 260 [2025-03-08 00:53:21,091 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 00:53:21,094 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:21,097 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:21,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 332 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 00:53:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 00:53:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 118 states have internal predecessors, (181), 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,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2025-03-08 00:53:21,120 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 24 [2025-03-08 00:53:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:21,120 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2025-03-08 00:53:21,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,121 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2025-03-08 00:53:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:53:21,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:21,122 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, 1] [2025-03-08 00:53:21,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:53:21,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1906739358, now seen corresponding path program 1 times [2025-03-08 00:53:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344454497] [2025-03-08 00:53:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:21,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:53:21,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:53:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,206 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:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344454497] [2025-03-08 00:53:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344454497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307639162] [2025-03-08 00:53:21,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:21,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:21,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:21,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,207 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:21,326 INFO L93 Difference]: Finished difference Result 242 states and 372 transitions. [2025-03-08 00:53:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:21,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2025-03-08 00:53:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:21,329 INFO L225 Difference]: With dead ends: 242 [2025-03-08 00:53:21,330 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 00:53:21,330 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:21,331 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:21,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 253 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 00:53:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-08 00:53:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.5151515151515151) internal successors, (200), 132 states have internal predecessors, (200), 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,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2025-03-08 00:53:21,344 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 35 [2025-03-08 00:53:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:21,344 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2025-03-08 00:53:21,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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,344 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2025-03-08 00:53:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:53:21,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:21,345 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, 1] [2025-03-08 00:53:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:53:21,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,345 INFO L85 PathProgramCache]: Analyzing trace with hash -126814283, now seen corresponding path program 1 times [2025-03-08 00:53:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:21,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468599098] [2025-03-08 00:53:21,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:21,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:53:21,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:53:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,436 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:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468599098] [2025-03-08 00:53:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468599098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:21,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723566492] [2025-03-08 00:53:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:21,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:21,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:21,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:21,439 INFO L87 Difference]: Start difference. First operand 133 states and 200 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:21,542 INFO L93 Difference]: Finished difference Result 272 states and 414 transitions. [2025-03-08 00:53:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 48 [2025-03-08 00:53:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:21,543 INFO L225 Difference]: With dead ends: 272 [2025-03-08 00:53:21,543 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 00:53:21,544 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:21,546 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:21,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 266 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 00:53:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 00:53:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 148 states have internal predecessors, (221), 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,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2025-03-08 00:53:21,557 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 221 transitions. Word has length 48 [2025-03-08 00:53:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:21,557 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 221 transitions. [2025-03-08 00:53:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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,557 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 221 transitions. [2025-03-08 00:53:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:53:21,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:21,558 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, 1, 1, 1] [2025-03-08 00:53:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:53:21,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:21,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash 174042645, now seen corresponding path program 1 times [2025-03-08 00:53:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282732982] [2025-03-08 00:53:21,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:21,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:53:21,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:53:21,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282732982] [2025-03-08 00:53:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282732982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746054066] [2025-03-08 00:53:21,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:21,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:21,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:21,705 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:21,706 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:21,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:53:21,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:53:21,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:21,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:21,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:53:21,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:21,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:21,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746054066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:21,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:21,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:53:21,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473567109] [2025-03-08 00:53:21,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:21,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:53:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:21,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:53:21,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:53:21,944 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,298 INFO L93 Difference]: Finished difference Result 595 states and 945 transitions. [2025-03-08 00:53:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:53:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 66 [2025-03-08 00:53:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,300 INFO L225 Difference]: With dead ends: 595 [2025-03-08 00:53:22,302 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 00:53:22,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:53:22,305 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 318 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 734 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 00:53:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2025-03-08 00:53:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.4547945205479451) internal successors, (531), 365 states have internal predecessors, (531), 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,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 531 transitions. [2025-03-08 00:53:22,327 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 531 transitions. Word has length 66 [2025-03-08 00:53:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 531 transitions. [2025-03-08 00:53:22,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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,329 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 531 transitions. [2025-03-08 00:53:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:53:22,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,331 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, 1, 1, 1] [2025-03-08 00:53:22,338 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:22,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1151039468, now seen corresponding path program 1 times [2025-03-08 00:53:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25208905] [2025-03-08 00:53:22,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:53:22,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:53:22,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,590 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:22,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:22,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25208905] [2025-03-08 00:53:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25208905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039046729] [2025-03-08 00:53:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:22,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,592 INFO L87 Difference]: Start difference. First operand 366 states and 531 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,618 INFO L93 Difference]: Finished difference Result 884 states and 1283 transitions. [2025-03-08 00:53:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 66 [2025-03-08 00:53:22,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,620 INFO L225 Difference]: With dead ends: 884 [2025-03-08 00:53:22,621 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 00:53:22,621 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:22,621 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 129 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 333 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 00:53:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 525. [2025-03-08 00:53:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.452290076335878) internal successors, (761), 524 states have internal predecessors, (761), 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,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 761 transitions. [2025-03-08 00:53:22,643 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 761 transitions. Word has length 66 [2025-03-08 00:53:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 761 transitions. [2025-03-08 00:53:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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,643 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 761 transitions. [2025-03-08 00:53:22,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:53:22,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,645 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, 1, 1, 1] [2025-03-08 00:53:22,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:53:22,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash -992653674, now seen corresponding path program 1 times [2025-03-08 00:53:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901387659] [2025-03-08 00:53:22,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:53:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:53:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,682 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:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901387659] [2025-03-08 00:53:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901387659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117076789] [2025-03-08 00:53:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:22,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:22,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:22,684 INFO L87 Difference]: Start difference. First operand 525 states and 761 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:22,698 INFO L93 Difference]: Finished difference Result 704 states and 1014 transitions. [2025-03-08 00:53:22,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:22,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 66 [2025-03-08 00:53:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:22,700 INFO L225 Difference]: With dead ends: 704 [2025-03-08 00:53:22,700 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 00:53:22,700 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:22,701 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 126 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:22,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 379 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 00:53:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2025-03-08 00:53:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.4457142857142857) internal successors, (506), 350 states have internal predecessors, (506), 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,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 506 transitions. [2025-03-08 00:53:22,710 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 506 transitions. Word has length 66 [2025-03-08 00:53:22,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:22,710 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 506 transitions. [2025-03-08 00:53:22,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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,710 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 506 transitions. [2025-03-08 00:53:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:53:22,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:22,712 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, 1, 1, 1] [2025-03-08 00:53:22,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:53:22,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1977231509, now seen corresponding path program 1 times [2025-03-08 00:53:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356562754] [2025-03-08 00:53:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:22,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:53:22,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:53:22,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356562754] [2025-03-08 00:53:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356562754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:53:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16260141] [2025-03-08 00:53:22,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:22,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:22,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:22,815 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:22,817 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:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:53:22,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:53:22,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:22,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:22,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:53:22,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:22,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16260141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:23,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:53:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-08 00:53:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691932593] [2025-03-08 00:53:23,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:53:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:53:23,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:53:23,032 INFO L87 Difference]: Start difference. First operand 351 states and 506 transitions. Second operand has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 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,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,395 INFO L93 Difference]: Finished difference Result 566 states and 828 transitions. [2025-03-08 00:53:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:53:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 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 66 [2025-03-08 00:53:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,397 INFO L225 Difference]: With dead ends: 566 [2025-03-08 00:53:23,397 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 00:53:23,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:53:23,398 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 417 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1218 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 00:53:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 351. [2025-03-08 00:53:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.44) internal successors, (504), 350 states have internal predecessors, (504), 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,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 504 transitions. [2025-03-08 00:53:23,408 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 504 transitions. Word has length 66 [2025-03-08 00:53:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,408 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 504 transitions. [2025-03-08 00:53:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 11 states have internal predecessors, (155), 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,408 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 504 transitions. [2025-03-08 00:53:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 00:53:23,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,409 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, 1, 1, 1, 1] [2025-03-08 00:53:23,415 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:23,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 00:53:23,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1155127673, now seen corresponding path program 1 times [2025-03-08 00:53:23,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804042815] [2025-03-08 00:53:23,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 00:53:23,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 00:53:23,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:23,678 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:23,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:53:23,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804042815] [2025-03-08 00:53:23,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804042815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:23,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:23,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:23,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823599979] [2025-03-08 00:53:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:23,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:53:23,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:23,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:23,681 INFO L87 Difference]: Start difference. First operand 351 states and 504 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:23,696 INFO L93 Difference]: Finished difference Result 527 states and 754 transitions. [2025-03-08 00:53:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 67 [2025-03-08 00:53:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:23,698 INFO L225 Difference]: With dead ends: 527 [2025-03-08 00:53:23,698 INFO L226 Difference]: Without dead ends: 353 [2025-03-08 00:53:23,698 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:23,699 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 125 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:23,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 327 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-08 00:53:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2025-03-08 00:53:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 1.437142857142857) internal successors, (503), 350 states have internal predecessors, (503), 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,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 503 transitions. [2025-03-08 00:53:23,709 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 503 transitions. Word has length 67 [2025-03-08 00:53:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:23,710 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 503 transitions. [2025-03-08 00:53:23,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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,710 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 503 transitions. [2025-03-08 00:53:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 00:53:23,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:23,711 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, 1, 1, 1, 1, 1] [2025-03-08 00:53:23,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:53:23,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:23,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1179555435, now seen corresponding path program 1 times [2025-03-08 00:53:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:53:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998713027] [2025-03-08 00:53:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:53:23,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 00:53:23,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:53:23,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:53:23,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:53:23,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 00:53:23,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:53:23,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:23,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:53:23,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:53:23,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:53:23,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:53:23,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:53:23,781 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:23,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:53:23,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:53:23 BoogieIcfgContainer [2025-03-08 00:53:23,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:53:23,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:53:23,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:53:23,860 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:53:23,861 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:20" (3/4) ... [2025-03-08 00:53:23,862 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 00:53:23,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:53:23,864 INFO L158 Benchmark]: Toolchain (without parser) took 4055.74ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 43.5MB in the end (delta: 69.6MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2025-03-08 00:53:23,864 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:23,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.21ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 97.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:53:23,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.86ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:23,865 INFO L158 Benchmark]: Boogie Preprocessor took 42.03ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:23,865 INFO L158 Benchmark]: IcfgBuilder took 518.63ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 56.7MB in the end (delta: 36.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 00:53:23,865 INFO L158 Benchmark]: TraceAbstraction took 3193.30ms. Allocated memory is still 142.6MB. Free memory was 56.2MB in the beginning and 43.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2025-03-08 00:53:23,866 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 142.6MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:23,867 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.45ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.21ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 97.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.86ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.03ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 518.63ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 56.7MB in the end (delta: 36.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3193.30ms. Allocated memory is still 142.6MB. Free memory was 56.2MB in the beginning and 43.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 142.6MB. Free memory was 43.5MB in the beginning and 43.5MB in the end (delta: 27.1kB). 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: 624]: 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 311. Possible FailurePath: [L633] int __retres1 ; [L637] 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 ag_Z ; [L74] int __retres60 ; [L77] s__state = 12292 [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] 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=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L84] COND TRUE s__info_callback != 0 [L85] 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=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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L93] 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=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L94] 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=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE \read(s__hit) [L104] ag_Y = 208 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND TRUE s__state == 12292 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L215] s__new_session = 1 [L216] s__state = 4096 [L217] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [ag_Y=208, 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=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L222] s__server = 0 VAL [ag_Y=208, 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=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L223] COND TRUE cb != 0 VAL [ag_Y=208, 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=1, 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=0, 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=0, tmp___7=0, tmp___8=0, tmp___9=0] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L235] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L253] COND FALSE !(! tmp___4) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L259] COND FALSE !(! tmp___5) [L265] s__state = 4368 [L266] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L267] s__init_num = 0 VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4368 VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L278] COND FALSE !(ret <= 0) [L283] s__state = 4384 [L284] ag_X = s__state - 32 [L285] s__init_num = 0 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L310] COND TRUE \read(s__hit) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L311] EXPR s__state | ag_Y VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L311] s__state = s__state | ag_Y [L315] s__init_num = 0 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L624] reach_error() VAL [ag_X=4352, ag_Y=208, 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=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 133 locations, 225 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1141 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1141 mSDsluCounter, 3842 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2311 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1370 IncrementalHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 1531 mSDtfsCounter, 1370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 638 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 690 ConstructedInterpolants, 0 QuantifiedInterpolants, 1691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 198/330 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:23,883 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_3.BV.c.cil-2a.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 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:53:25,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:53:25,737 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:25,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:53:25,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:53:25,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:53:25,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:53:25,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:53:25,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:53:25,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:53:25,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:53:25,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:53:25,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:53:25,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:53:25,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:53:25,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:53:25,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:53:25,764 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:53:25,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:53:25,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:53:25,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:53:25,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:53:25,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:53:25,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:53:25,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:25,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:53:25,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:53:25,768 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 -> 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 [2025-03-08 00:53:25,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:53:26,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:53:26,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:53:26,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:53:26,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:53:26,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2025-03-08 00:53:27,129 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d15ed0a/ae77227b8bb14a748bc5079ed698df05/FLAG8172aac35 [2025-03-08 00:53:27,321 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:53:27,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2025-03-08 00:53:27,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d15ed0a/ae77227b8bb14a748bc5079ed698df05/FLAG8172aac35 [2025-03-08 00:53:27,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d15ed0a/ae77227b8bb14a748bc5079ed698df05 [2025-03-08 00:53:27,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:53:27,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:53:27,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:27,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:53:27,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:53:27,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:27" (1/1) ... [2025-03-08 00:53:27,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697fc601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:27, skipping insertion in model container [2025-03-08 00:53:27,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:53:27" (1/1) ... [2025-03-08 00:53:27,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:53:27,857 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_3.BV.c.cil-2a.c[37884,37897] [2025-03-08 00:53:27,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:27,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:53:27,929 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_3.BV.c.cil-2a.c[37884,37897] [2025-03-08 00:53:27,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:53:27,940 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:53:27,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:27 WrapperNode [2025-03-08 00:53:27,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:53:27,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:27,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:53:27,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:53:27,948 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:27" (1/1) ... [2025-03-08 00:53:27,956 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:27" (1/1) ... [2025-03-08 00:53:27,983 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 471 [2025-03-08 00:53:27,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:53:27,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:53:27,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:53:27,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:53:27,992 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:27" (1/1) ... [2025-03-08 00:53:27,992 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:27" (1/1) ... [2025-03-08 00:53:27,994 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:27" (1/1) ... [2025-03-08 00:53:28,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:53:28,009 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:27" (1/1) ... [2025-03-08 00:53:28,009 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:27" (1/1) ... [2025-03-08 00:53:28,018 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:27" (1/1) ... [2025-03-08 00:53:28,021 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:27" (1/1) ... [2025-03-08 00:53:28,023 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:27" (1/1) ... [2025-03-08 00:53:28,028 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:27" (1/1) ... [2025-03-08 00:53:28,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:53:28,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:53:28,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:53:28,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:53:28,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:27" (1/1) ... [2025-03-08 00:53:28,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:53:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:28,074 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:28,078 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:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:53:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 00:53:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:53:28,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:53:28,174 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:53:28,176 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:53:28,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume false; [2025-03-08 00:53:28,543 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume !false; [2025-03-08 00:53:28,570 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-08 00:53:28,571 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:53:28,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:53:28,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:53:28,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:28 BoogieIcfgContainer [2025-03-08 00:53:28,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:53:28,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:53:28,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:53:28,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:53:28,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:53:27" (1/3) ... [2025-03-08 00:53:28,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253eca13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:28, skipping insertion in model container [2025-03-08 00:53:28,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:53:27" (2/3) ... [2025-03-08 00:53:28,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253eca13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:53:28, skipping insertion in model container [2025-03-08 00:53:28,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:53:28" (3/3) ... [2025-03-08 00:53:28,609 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2025-03-08 00:53:28,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:53:28,622 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_3.BV.c.cil-2a.c that has 1 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:53:28,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:53:28,672 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;@3f10f6e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:53:28,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:53:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:53:28,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:28,682 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, 1] [2025-03-08 00:53:28,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:28,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 53985893, now seen corresponding path program 1 times [2025-03-08 00:53:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:28,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565816530] [2025-03-08 00:53:28,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:28,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:28,708 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:28,709 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:28,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:53:28,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:53:28,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:28,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:28,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:28,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:28,811 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:28,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:28,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:28,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565816530] [2025-03-08 00:53:28,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565816530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:28,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:28,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629125567] [2025-03-08 00:53:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:28,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:28,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:28,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:28,831 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7317073170731707) internal successors, (213), 124 states have internal predecessors, (213), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:28,956 INFO L93 Difference]: Finished difference Result 244 states and 417 transitions. [2025-03-08 00:53:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-03-08 00:53:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:28,966 INFO L225 Difference]: With dead ends: 244 [2025-03-08 00:53:28,966 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 00:53:28,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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,970 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:28,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 318 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 00:53:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 00:53:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 110 states have internal predecessors, (169), 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,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 169 transitions. [2025-03-08 00:53:29,001 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 169 transitions. Word has length 24 [2025-03-08 00:53:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:29,001 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 169 transitions. [2025-03-08 00:53:29,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 L276 IsEmpty]: Start isEmpty. Operand 111 states and 169 transitions. [2025-03-08 00:53:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:53:29,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:29,005 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, 1] [2025-03-08 00:53:29,012 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:29,210 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:29,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -881176383, now seen corresponding path program 1 times [2025-03-08 00:53:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:29,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380046731] [2025-03-08 00:53:29,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:29,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:29,213 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:29,217 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:29,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:53:29,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:53:29,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:29,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:29,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:29,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:29,276 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:29,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:29,277 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380046731] [2025-03-08 00:53:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380046731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:29,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:29,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992135854] [2025-03-08 00:53:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:29,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:29,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:29,278 INFO L87 Difference]: Start difference. First operand 111 states and 169 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:29,388 INFO L93 Difference]: Finished difference Result 226 states and 348 transitions. [2025-03-08 00:53:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2025-03-08 00:53:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:29,389 INFO L225 Difference]: With dead ends: 226 [2025-03-08 00:53:29,389 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 00:53:29,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:29,392 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:29,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 239 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 00:53:29,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-08 00:53:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.5161290322580645) internal successors, (188), 124 states have internal predecessors, (188), 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,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2025-03-08 00:53:29,397 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 35 [2025-03-08 00:53:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:29,398 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2025-03-08 00:53:29,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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,398 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2025-03-08 00:53:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:53:29,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:29,399 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, 1] [2025-03-08 00:53:29,405 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:29,599 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:29,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1910115012, now seen corresponding path program 1 times [2025-03-08 00:53:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402199972] [2025-03-08 00:53:29,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:29,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:29,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:29,603 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:29,605 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:29,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:53:29,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:53:29,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:29,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:29,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:29,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:29,688 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:29,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:29,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402199972] [2025-03-08 00:53:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402199972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:29,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612465611] [2025-03-08 00:53:29,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:29,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:29,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:29,693 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:29,800 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2025-03-08 00:53:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:29,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 48 [2025-03-08 00:53:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:29,802 INFO L225 Difference]: With dead ends: 256 [2025-03-08 00:53:29,802 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 00:53:29,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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:29,803 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:29,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 252 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 00:53:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-08 00:53:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4928571428571429) internal successors, (209), 140 states have internal predecessors, (209), 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,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2025-03-08 00:53:29,813 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 48 [2025-03-08 00:53:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:29,813 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2025-03-08 00:53:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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,813 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2025-03-08 00:53:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:53:29,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:29,816 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, 1] [2025-03-08 00:53:29,823 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:30,016 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:30,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:30,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash -892055151, now seen corresponding path program 1 times [2025-03-08 00:53:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142008292] [2025-03-08 00:53:30,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:30,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:30,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:53:30,020 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:30,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 00:53:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:53:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:30,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:30,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:30,122 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:30,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:30,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:30,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142008292] [2025-03-08 00:53:30,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142008292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:30,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60283316] [2025-03-08 00:53:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:30,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:30,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:30,123 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:30,143 INFO L93 Difference]: Finished difference Result 404 states and 597 transitions. [2025-03-08 00:53:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:30,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 64 [2025-03-08 00:53:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:30,144 INFO L225 Difference]: With dead ends: 404 [2025-03-08 00:53:30,144 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 00:53:30,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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,145 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 122 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:30,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 322 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 00:53:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2025-03-08 00:53:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4777777777777779) internal successors, (399), 270 states have internal predecessors, (399), 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,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 399 transitions. [2025-03-08 00:53:30,154 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 399 transitions. Word has length 64 [2025-03-08 00:53:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:30,154 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 399 transitions. [2025-03-08 00:53:30,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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,154 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 399 transitions. [2025-03-08 00:53:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:53:30,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:30,156 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, 1] [2025-03-08 00:53:30,161 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:30,357 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:30,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:30,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1364855856, now seen corresponding path program 1 times [2025-03-08 00:53:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1657143828] [2025-03-08 00:53:30,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:30,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:30,361 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:30,363 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:30,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 00:53:30,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:53:30,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:30,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:30,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:30,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:30,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:30,702 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657143828] [2025-03-08 00:53:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657143828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:30,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:53:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 00:53:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151266288] [2025-03-08 00:53:30,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:30,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:30,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:30,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:30,705 INFO L87 Difference]: Start difference. First operand 271 states and 399 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:31,127 INFO L93 Difference]: Finished difference Result 849 states and 1324 transitions. [2025-03-08 00:53:31,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:53:31,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 64 [2025-03-08 00:53:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:31,130 INFO L225 Difference]: With dead ends: 849 [2025-03-08 00:53:31,130 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 00:53:31,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 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:31,131 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 482 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:31,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 465 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:53:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 00:53:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2025-03-08 00:53:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4826989619377162) internal successors, (857), 578 states have internal predecessors, (857), 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,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 857 transitions. [2025-03-08 00:53:31,160 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 857 transitions. Word has length 64 [2025-03-08 00:53:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:31,160 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 857 transitions. [2025-03-08 00:53:31,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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,161 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 857 transitions. [2025-03-08 00:53:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:53:31,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:31,162 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, 1] [2025-03-08 00:53:31,169 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:31,363 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:31,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1172405040, now seen corresponding path program 1 times [2025-03-08 00:53:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:31,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715631276] [2025-03-08 00:53:31,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:31,366 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:31,367 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:31,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 00:53:31,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:53:31,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:31,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:31,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:53:31,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:31,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:53:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:53:31,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715631276] [2025-03-08 00:53:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715631276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:53:31,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:53:31,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-08 00:53:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811669404] [2025-03-08 00:53:31,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:53:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:53:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:53:31,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:53:31,625 INFO L87 Difference]: Start difference. First operand 579 states and 857 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:32,004 INFO L93 Difference]: Finished difference Result 1022 states and 1525 transitions. [2025-03-08 00:53:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:53:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 64 [2025-03-08 00:53:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:32,007 INFO L225 Difference]: With dead ends: 1022 [2025-03-08 00:53:32,007 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 00:53:32,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 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,008 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 251 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:32,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 597 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:53:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 00:53:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 618. [2025-03-08 00:53:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 1.4619124797406806) internal successors, (902), 617 states have internal predecessors, (902), 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,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 902 transitions. [2025-03-08 00:53:32,033 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 902 transitions. Word has length 64 [2025-03-08 00:53:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:32,034 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 902 transitions. [2025-03-08 00:53:32,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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,034 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 902 transitions. [2025-03-08 00:53:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 00:53:32,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:32,035 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, 1] [2025-03-08 00:53:32,041 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:32,240 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:32,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1084505967, now seen corresponding path program 1 times [2025-03-08 00:53:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138351499] [2025-03-08 00:53:32,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:32,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:32,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:32,243 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:32,244 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:32,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 00:53:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 00:53:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:32,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:32,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:32,329 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:32,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:32,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138351499] [2025-03-08 00:53:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138351499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686340511] [2025-03-08 00:53:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:32,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:32,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:32,330 INFO L87 Difference]: Start difference. First operand 618 states and 902 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:32,346 INFO L93 Difference]: Finished difference Result 622 states and 904 transitions. [2025-03-08 00:53:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:32,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 64 [2025-03-08 00:53:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:32,348 INFO L225 Difference]: With dead ends: 622 [2025-03-08 00:53:32,348 INFO L226 Difference]: Without dead ends: 432 [2025-03-08 00:53:32,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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:32,349 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:32,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 459 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:53:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-08 00:53:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2025-03-08 00:53:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.4475524475524475) internal successors, (621), 429 states have internal predecessors, (621), 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,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 621 transitions. [2025-03-08 00:53:32,358 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 621 transitions. Word has length 64 [2025-03-08 00:53:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:32,359 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 621 transitions. [2025-03-08 00:53:32,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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,359 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 621 transitions. [2025-03-08 00:53:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 00:53:32,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:32,359 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, 1, 1] [2025-03-08 00:53:32,366 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:32,560 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:32,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:32,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1775986934, now seen corresponding path program 1 times [2025-03-08 00:53:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589046414] [2025-03-08 00:53:32,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:32,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:32,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:32,566 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:32,567 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:32,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 00:53:32,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 00:53:32,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:32,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:32,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:32,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:32,650 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:32,650 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:32,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589046414] [2025-03-08 00:53:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589046414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:32,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:32,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534927026] [2025-03-08 00:53:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:32,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:32,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:32,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:32,651 INFO L87 Difference]: Start difference. First operand 430 states and 621 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:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:32,738 INFO L93 Difference]: Finished difference Result 888 states and 1299 transitions. [2025-03-08 00:53:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:32,738 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 80 [2025-03-08 00:53:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:32,740 INFO L225 Difference]: With dead ends: 888 [2025-03-08 00:53:32,740 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 00:53:32,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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:32,740 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:53:32,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 256 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:53:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 00:53:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-08 00:53:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.4307036247334755) internal successors, (671), 469 states have internal predecessors, (671), 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,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 671 transitions. [2025-03-08 00:53:32,752 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 671 transitions. Word has length 80 [2025-03-08 00:53:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:32,752 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 671 transitions. [2025-03-08 00:53:32,752 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:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 671 transitions. [2025-03-08 00:53:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 00:53:32,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:32,753 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2025-03-08 00:53:32,760 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:32,957 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:32,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:32,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash 815292722, now seen corresponding path program 1 times [2025-03-08 00:53:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531271736] [2025-03-08 00:53:32,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:32,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:32,959 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:32,960 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:32,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 00:53:33,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 00:53:33,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:33,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:33,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:33,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 00:53:33,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:33,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531271736] [2025-03-08 00:53:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531271736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780434727] [2025-03-08 00:53:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:33,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:33,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:33,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:33,042 INFO L87 Difference]: Start difference. First operand 470 states and 671 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:33,146 INFO L93 Difference]: Finished difference Result 988 states and 1437 transitions. [2025-03-08 00:53:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:33,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 88 [2025-03-08 00:53:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:33,148 INFO L225 Difference]: With dead ends: 988 [2025-03-08 00:53:33,149 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 00:53:33,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 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:33,149 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 257 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:33,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 257 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:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 00:53:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-08 00:53:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.4007561436672968) internal successors, (741), 529 states have internal predecessors, (741), 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:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 741 transitions. [2025-03-08 00:53:33,162 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 741 transitions. Word has length 88 [2025-03-08 00:53:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:33,162 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 741 transitions. [2025-03-08 00:53:33,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 741 transitions. [2025-03-08 00:53:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 00:53:33,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:33,164 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:33,170 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:33,364 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:33,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:33,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash 501788104, now seen corresponding path program 1 times [2025-03-08 00:53:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075293464] [2025-03-08 00:53:33,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:33,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:33,367 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:33,368 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:33,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 00:53:33,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 00:53:33,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:33,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:53:33,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:53:33,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:53:33,462 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:33,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:53:33,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 00:53:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075293464] [2025-03-08 00:53:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075293464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:53:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:53:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:53:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519229146] [2025-03-08 00:53:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:53:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:53:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 00:53:33,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:53:33,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:53:33,463 INFO L87 Difference]: Start difference. First operand 530 states and 741 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:53:33,492 INFO L93 Difference]: Finished difference Result 1560 states and 2184 transitions. [2025-03-08 00:53:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:53:33,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:53:33,495 INFO L225 Difference]: With dead ends: 1560 [2025-03-08 00:53:33,495 INFO L226 Difference]: Without dead ends: 1042 [2025-03-08 00:53:33,496 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:33,496 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 121 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 357 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:33,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 357 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:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-08 00:53:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1040. [2025-03-08 00:53:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 1.3917228103946102) internal successors, (1446), 1039 states have internal predecessors, (1446), 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:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1446 transitions. [2025-03-08 00:53:33,515 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1446 transitions. Word has length 98 [2025-03-08 00:53:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:53:33,515 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1446 transitions. [2025-03-08 00:53:33,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1446 transitions. [2025-03-08 00:53:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 00:53:33,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:53:33,516 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:33,522 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:33,717 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:33,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:53:33,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:53:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1746552585, now seen corresponding path program 1 times [2025-03-08 00:53:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 00:53:33,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1720676276] [2025-03-08 00:53:33,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:53:33,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:53:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:53:33,720 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:33,720 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:33,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 00:53:33,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 00:53:33,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:33,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:53:33,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:53:33,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 00:53:33,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 00:53:33,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:53:33,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:53:33,828 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 00:53:33,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:53:33,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:53:33,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:53:34,031 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:34,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:53:34,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:53:34,093 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,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:53:34,094 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:53:34,094 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:53:34,094 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:53:34,097 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:28" (3/4) ... [2025-03-08 00:53:34,098 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 00:53:34,179 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 77. [2025-03-08 00:53:34,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:53:34,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:53:34,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:53:34,243 INFO L158 Benchmark]: Toolchain (without parser) took 6546.16ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 49.8MB in the end (delta: 42.6MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,243 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:34,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.95ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 76.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.66ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:34,244 INFO L158 Benchmark]: Boogie Preprocessor took 45.82ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 72.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:53:34,244 INFO L158 Benchmark]: IcfgBuilder took 546.41ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 37.5MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,244 INFO L158 Benchmark]: TraceAbstraction took 5490.76ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.7MB in the end (delta: 23.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,244 INFO L158 Benchmark]: Witness Printer took 148.94ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 49.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 00:53:34,246 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.20ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.95ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 76.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.66ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.82ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 72.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 546.41ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 37.5MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5490.76ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 67.7MB in the end (delta: 23.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Witness Printer took 148.94ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 49.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 624]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L633] int __retres1 ; [L637] 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 ag_Z ; [L74] int __retres60 ; [L77] s__state = 12292 [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 VAL [blastFlag=0, cb=0, ret=-1, s__state=12292, skip=0] [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback VAL [blastFlag=0, cb=1, ret=-1, s__state=12292, skip=0] [L93] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=1, ret=-1, s__in_handshake=-2, s__state=12292, skip=0] [L94] COND FALSE !(tmp___1 + 12288) VAL [blastFlag=0, cb=1, ret=-1, s__in_handshake=-2, s__state=12292, skip=0] [L103] COND FALSE !(\read(s__hit)) [L106] ag_Z = 48 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__hit=0, s__in_handshake=-2, s__state=12292, skip=0] [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__hit=0, s__in_handshake=-2, s__state=12292, skip=0, state=12292] [L112] COND TRUE s__state == 12292 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__hit=0, s__in_handshake=-2, skip=0, state=12292] [L215] s__new_session = 1 [L216] s__state = 4096 [L217] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, skip=0, state=12292] [L222] s__server = 0 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, skip=0, state=12292] [L223] COND TRUE cb != 0 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, skip=0, state=12292] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__version=-64512, skip=0, state=12292] [L235] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__version=-64512, skip=0, state=12292] [L253] COND FALSE !(! tmp___4) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__version=-64512, skip=0, state=12292, tmp___4=1] [L259] COND FALSE !(! tmp___5) [L265] s__state = 4368 [L266] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L267] s__init_num = 0 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=1, tmp___5=1] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=1, tmp___5=1] [L611] skip = 0 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=1, tmp___5=1] [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L112] COND FALSE !(s__state == 12292) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L115] COND FALSE !(s__state == 16384) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L118] COND FALSE !(s__state == 4096) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L121] COND FALSE !(s__state == 20480) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L124] COND FALSE !(s__state == 4099) VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L127] COND TRUE s__state == 4368 VAL [ag_Z=48, blastFlag=0, cb=1, ret=-1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Z=48, blastFlag=1, cb=1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L278] COND FALSE !(ret <= 0) [L283] s__state = 4384 [L284] ag_X = s__state - 32 [L285] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, skip=0, state=4368, tmp___4=1, tmp___5=1] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___4=1, tmp___5=1] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___4=1, tmp___5=1] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___4=1, tmp___5=1] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L310] COND FALSE !(\read(s__hit)) [L313] s__state = s__state | ag_Z VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L315] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___4=1, tmp___5=1] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L139] COND TRUE s__state == 4400 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L319] COND TRUE (unsigned long )s__s3__tmp__new_cipher__algorithms + 256UL [L320] skip = 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=1, state=4400, tmp___4=1, tmp___5=1] [L334] s__state = 4416 [L335] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=1, state=4400, tmp___4=1, tmp___5=1] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=1, state=4400, tmp___4=1, tmp___5=1] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4400, tmp___4=1, tmp___5=1] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L145] COND TRUE s__state == 4416 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L339] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L340] COND FALSE !(blastFlag == 3) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L345] COND FALSE !(ret <= 0) [L350] s__state = 4432 [L351] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1] [L352] COND FALSE !(! tmp___6) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1, tmp___6=1] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1, tmp___6=1] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4416, tmp___4=1, tmp___5=1, tmp___6=1] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=1, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=1, ret=0, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Z=48, cb=1, ret=0, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] [L624] reach_error() VAL [ag_X=4352, ag_Z=48, cb=1, ret=0, s__bbio=0, s__ctx__stats__sess_connect=-2, s__ctx__stats__sess_connect_renegotiate=-2147483648, s__hit=0, s__in_handshake=-2, s__init_buf___0=1, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 213 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1152 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1152 mSDsluCounter, 3522 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1624 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 1898 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 729 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1040occurred in iteration=10, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 745 ConstructedInterpolants, 110 QuantifiedInterpolants, 2000 SizeOfPredicates, 4 NumberOfNonLiveVariables, 925 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 402/490 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 proved your program to be incorrect! [2025-03-08 00:53:34,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE