./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:00:22,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:00:22,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:00:22,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:00:22,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:00:22,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:00:22,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:00:22,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:00:22,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:00:22,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:00:22,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:00:22,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:00:22,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:00:22,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:00:22,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:00:22,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:00:22,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:00:22,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:00:22,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:00:22,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:00:22,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:00:22,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:00:22,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:00:22,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:00:22,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:00:22,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:00:22,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:00:22,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:00:22,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:00:22,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:00:22,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:00:22,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:00:22,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:22,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:00:22,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:00:22,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:00:22,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:00:22,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:00:22,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:00:22,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:00:22,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:00:22,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:00:22,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-11 16:00:22,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:00:22,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:00:22,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:00:22,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:00:22,938 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:00:22,939 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 [2024-11-11 16:00:24,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:00:24,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:00:24,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-11 16:00:24,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e3fdacd/b443ad06e3734e2a8683eb0348c408f5/FLAGf86f09088 [2024-11-11 16:00:24,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e3fdacd/b443ad06e3734e2a8683eb0348c408f5 [2024-11-11 16:00:24,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:00:24,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:00:24,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:24,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:00:24,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:00:24,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:24,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43493b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24, skipping insertion in model container [2024-11-11 16:00:24,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:24,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:00:24,900 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] [2024-11-11 16:00:24,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:24,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:00:24,949 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] [2024-11-11 16:00:24,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:24,965 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:00:24,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24 WrapperNode [2024-11-11 16:00:24,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:24,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:24,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:00:24,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:00:24,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:24,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,005 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2024-11-11 16:00:25,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:25,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:00:25,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:00:25,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:00:25,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,034 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]. [2024-11-11 16:00:25,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:00:25,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:00:25,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:00:25,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:00:25,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (1/1) ... [2024-11-11 16:00:25,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:25,088 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) [2024-11-11 16:00:25,091 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 [2024-11-11 16:00:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:00:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:00:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:00:25,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:00:25,209 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:00:25,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:00:25,229 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-11 16:00:25,585 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-11 16:00:25,585 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-11 16:00:25,617 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-11 16:00:25,617 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:00:25,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:00:25,632 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:00:25,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:25 BoogieIcfgContainer [2024-11-11 16:00:25,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:00:25,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:00:25,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:00:25,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:00:25,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:00:24" (1/3) ... [2024-11-11 16:00:25,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728133a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:25, skipping insertion in model container [2024-11-11 16:00:25,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:24" (2/3) ... [2024-11-11 16:00:25,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728133a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:25, skipping insertion in model container [2024-11-11 16:00:25,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:25" (3/3) ... [2024-11-11 16:00:25,640 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-11-11 16:00:25,651 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:00:25,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:00:25,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:00:25,702 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;@eddaabb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:00:25,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:00:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.7196969696969697) internal successors, (227), 133 states have internal predecessors, (227), 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) [2024-11-11 16:00:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 16:00:25,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:25,711 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, 1] [2024-11-11 16:00:25,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:25,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:25,716 INFO L85 PathProgramCache]: Analyzing trace with hash 260024923, now seen corresponding path program 1 times [2024-11-11 16:00:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93397863] [2024-11-11 16:00:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93397863] [2024-11-11 16:00:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93397863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325177067] [2024-11-11 16:00:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:25,947 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.7196969696969697) internal successors, (227), 133 states have internal predecessors, (227), 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.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-11 16:00:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,120 INFO L93 Difference]: Finished difference Result 263 states and 447 transitions. [2024-11-11 16:00:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-11-11 16:00:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,128 INFO L225 Difference]: With dead ends: 263 [2024-11-11 16:00:26,128 INFO L226 Difference]: Without dead ends: 121 [2024-11-11 16:00:26,130 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 [2024-11-11 16:00:26,132 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 336 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-11 16:00:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-11 16:00:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.525) internal successors, (183), 120 states have internal predecessors, (183), 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) [2024-11-11 16:00:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2024-11-11 16:00:26,160 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 25 [2024-11-11 16:00:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,160 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2024-11-11 16:00:26,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-11 16:00:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2024-11-11 16:00:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 16:00:26,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,161 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:00:26,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:00:26,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 298727515, now seen corresponding path program 1 times [2024-11-11 16:00:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634744394] [2024-11-11 16:00:26,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634744394] [2024-11-11 16:00:26,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634744394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730939676] [2024-11-11 16:00:26,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,245 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-11-11 16:00:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,360 INFO L93 Difference]: Finished difference Result 246 states and 376 transitions. [2024-11-11 16:00:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-11 16:00:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,362 INFO L225 Difference]: With dead ends: 246 [2024-11-11 16:00:26,362 INFO L226 Difference]: Without dead ends: 136 [2024-11-11 16:00:26,362 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 [2024-11-11 16:00:26,363 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 258 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-11 16:00:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-11 16:00:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5037037037037038) internal successors, (203), 135 states have internal predecessors, (203), 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) [2024-11-11 16:00:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2024-11-11 16:00:26,382 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 37 [2024-11-11 16:00:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,383 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2024-11-11 16:00:26,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-11-11 16:00:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2024-11-11 16:00:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 16:00:26,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,384 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:00:26,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:00:26,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1202041694, now seen corresponding path program 1 times [2024-11-11 16:00:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128542152] [2024-11-11 16:00:26,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128542152] [2024-11-11 16:00:26,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128542152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374654266] [2024-11-11 16:00:26,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,481 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,496 INFO L93 Difference]: Finished difference Result 287 states and 424 transitions. [2024-11-11 16:00:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2024-11-11 16:00:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,498 INFO L225 Difference]: With dead ends: 287 [2024-11-11 16:00:26,498 INFO L226 Difference]: Without dead ends: 162 [2024-11-11 16:00:26,498 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 [2024-11-11 16:00:26,499 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-11 16:00:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-11 16:00:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 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) [2024-11-11 16:00:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2024-11-11 16:00:26,512 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 51 [2024-11-11 16:00:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,512 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2024-11-11 16:00:26,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-11 16:00:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 16:00:26,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,514 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:00:26,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:00:26,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1068028188, now seen corresponding path program 1 times [2024-11-11 16:00:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552483528] [2024-11-11 16:00:26,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:26,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552483528] [2024-11-11 16:00:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552483528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660919927] [2024-11-11 16:00:26,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,585 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,680 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2024-11-11 16:00:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2024-11-11 16:00:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,683 INFO L225 Difference]: With dead ends: 304 [2024-11-11 16:00:26,683 INFO L226 Difference]: Without dead ends: 179 [2024-11-11 16:00:26,685 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 [2024-11-11 16:00:26,688 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:26,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-11 16:00:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-11 16:00:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.449438202247191) internal successors, (258), 178 states have internal predecessors, (258), 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) [2024-11-11 16:00:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2024-11-11 16:00:26,698 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 51 [2024-11-11 16:00:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,698 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2024-11-11 16:00:26,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2024-11-11 16:00:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 16:00:26,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,700 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:26,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:00:26,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 116906692, now seen corresponding path program 1 times [2024-11-11 16:00:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061498943] [2024-11-11 16:00:26,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061498943] [2024-11-11 16:00:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061498943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417827693] [2024-11-11 16:00:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:26,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:26,779 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:26,796 INFO L93 Difference]: Finished difference Result 483 states and 698 transitions. [2024-11-11 16:00:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:26,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 16:00:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:26,799 INFO L225 Difference]: With dead ends: 483 [2024-11-11 16:00:26,800 INFO L226 Difference]: Without dead ends: 341 [2024-11-11 16:00:26,800 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 [2024-11-11 16:00:26,802 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 130 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 341 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 [2024-11-11 16:00:26,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-11 16:00:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2024-11-11 16:00:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4349112426035502) internal successors, (485), 338 states have internal predecessors, (485), 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) [2024-11-11 16:00:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 485 transitions. [2024-11-11 16:00:26,821 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 485 transitions. Word has length 70 [2024-11-11 16:00:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:26,821 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 485 transitions. [2024-11-11 16:00:26,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 485 transitions. [2024-11-11 16:00:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 16:00:26,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:26,823 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:26,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:00:26,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:26,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:26,823 INFO L85 PathProgramCache]: Analyzing trace with hash 723779029, now seen corresponding path program 1 times [2024-11-11 16:00:26,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123484788] [2024-11-11 16:00:26,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123484788] [2024-11-11 16:00:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123484788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684209167] [2024-11-11 16:00:26,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:26,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:26,946 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) [2024-11-11 16:00:26,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:00:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:27,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:00:27,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:27,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:27,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684209167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:27,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-11 16:00:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060924659] [2024-11-11 16:00:27,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:27,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 16:00:27,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 16:00:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:00:27,243 INFO L87 Difference]: Start difference. First operand 339 states and 485 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:27,684 INFO L93 Difference]: Finished difference Result 1000 states and 1551 transitions. [2024-11-11 16:00:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:00:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 16:00:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:27,687 INFO L225 Difference]: With dead ends: 1000 [2024-11-11 16:00:27,687 INFO L226 Difference]: Without dead ends: 599 [2024-11-11 16:00:27,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:00:27,688 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 284 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:27,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 958 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:00:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-11 16:00:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 591. [2024-11-11 16:00:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4254237288135594) internal successors, (841), 590 states have internal predecessors, (841), 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) [2024-11-11 16:00:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 841 transitions. [2024-11-11 16:00:27,708 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 841 transitions. Word has length 70 [2024-11-11 16:00:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:27,709 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 841 transitions. [2024-11-11 16:00:27,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 841 transitions. [2024-11-11 16:00:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 16:00:27,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:27,711 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:27,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:00:27,912 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,SelfDestructingSolverStorable5 [2024-11-11 16:00:27,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1569273146, now seen corresponding path program 1 times [2024-11-11 16:00:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012647045] [2024-11-11 16:00:27,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012647045] [2024-11-11 16:00:28,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012647045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:00:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475171080] [2024-11-11 16:00:28,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:28,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:00:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:28,027 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) [2024-11-11 16:00:28,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:00:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:00:28,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:28,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:28,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475171080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:28,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:00:28,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-11 16:00:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703970338] [2024-11-11 16:00:28,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:28,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:00:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:28,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:00:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:00:28,259 INFO L87 Difference]: Start difference. First operand 591 states and 841 transitions. Second operand has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 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) [2024-11-11 16:00:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:28,603 INFO L93 Difference]: Finished difference Result 1341 states and 1933 transitions. [2024-11-11 16:00:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:00:28,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 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 70 [2024-11-11 16:00:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:28,606 INFO L225 Difference]: With dead ends: 1341 [2024-11-11 16:00:28,606 INFO L226 Difference]: Without dead ends: 773 [2024-11-11 16:00:28,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-11 16:00:28,609 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 270 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:28,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1197 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:00:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-11-11 16:00:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 591. [2024-11-11 16:00:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4220338983050846) internal successors, (839), 590 states have internal predecessors, (839), 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) [2024-11-11 16:00:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 839 transitions. [2024-11-11 16:00:28,622 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 839 transitions. Word has length 70 [2024-11-11 16:00:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 839 transitions. [2024-11-11 16:00:28,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 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) [2024-11-11 16:00:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 839 transitions. [2024-11-11 16:00:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 16:00:28,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:28,624 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:28,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:00:28,828 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 [2024-11-11 16:00:28,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -962400809, now seen corresponding path program 1 times [2024-11-11 16:00:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:28,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046072142] [2024-11-11 16:00:28,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:28,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046072142] [2024-11-11 16:00:28,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046072142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:28,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:28,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376862840] [2024-11-11 16:00:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:28,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,887 INFO L87 Difference]: Start difference. First operand 591 states and 839 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:28,902 INFO L93 Difference]: Finished difference Result 774 states and 1096 transitions. [2024-11-11 16:00:28,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:28,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 16:00:28,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:28,904 INFO L225 Difference]: With dead ends: 774 [2024-11-11 16:00:28,906 INFO L226 Difference]: Without dead ends: 417 [2024-11-11 16:00:28,906 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 [2024-11-11 16:00:28,907 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 124 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 482 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-11 16:00:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2024-11-11 16:00:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4077669902912622) internal successors, (580), 412 states have internal predecessors, (580), 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) [2024-11-11 16:00:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 580 transitions. [2024-11-11 16:00:28,916 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 580 transitions. Word has length 70 [2024-11-11 16:00:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:28,916 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 580 transitions. [2024-11-11 16:00:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 580 transitions. [2024-11-11 16:00:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 16:00:28,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:28,918 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:28,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:00:28,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:28,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1736122508, now seen corresponding path program 1 times [2024-11-11 16:00:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964288487] [2024-11-11 16:00:28,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:00:28,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964288487] [2024-11-11 16:00:28,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964288487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:28,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:28,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:28,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141398579] [2024-11-11 16:00:28,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:28,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:00:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:28,964 INFO L87 Difference]: Start difference. First operand 413 states and 580 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-11 16:00:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:28,972 INFO L93 Difference]: Finished difference Result 593 states and 834 transitions. [2024-11-11 16:00:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 71 [2024-11-11 16:00:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:28,974 INFO L225 Difference]: With dead ends: 593 [2024-11-11 16:00:28,974 INFO L226 Difference]: Without dead ends: 415 [2024-11-11 16:00:28,974 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 [2024-11-11 16:00:28,976 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 125 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:28,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 331 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-11 16:00:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2024-11-11 16:00:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4053398058252426) internal successors, (579), 412 states have internal predecessors, (579), 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) [2024-11-11 16:00:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 579 transitions. [2024-11-11 16:00:28,983 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 579 transitions. Word has length 71 [2024-11-11 16:00:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 579 transitions. [2024-11-11 16:00:28,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2024-11-11 16:00:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 579 transitions. [2024-11-11 16:00:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 16:00:28,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:28,985 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:28,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:00:28,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:28,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:28,986 INFO L85 PathProgramCache]: Analyzing trace with hash -884679086, now seen corresponding path program 1 times [2024-11-11 16:00:28,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:00:28,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299863387] [2024-11-11 16:00:28,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:28,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:00:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:00:29,001 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 16:00:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:00:29,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 16:00:29,038 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 16:00:29,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:00:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:00:29,043 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:29,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:00:29,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:00:29 BoogieIcfgContainer [2024-11-11 16:00:29,126 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:00:29,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:00:29,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:00:29,127 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:00:29,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:25" (3/4) ... [2024-11-11 16:00:29,129 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 16:00:29,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:00:29,131 INFO L158 Benchmark]: Toolchain (without parser) took 4470.89ms. Allocated memory was 130.0MB in the beginning and 216.0MB in the end (delta: 86.0MB). Free memory was 73.0MB in the beginning and 93.5MB in the end (delta: -20.4MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2024-11-11 16:00:29,131 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:00:29,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.43ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 72.7MB in the beginning and 135.3MB in the end (delta: -62.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-11 16:00:29,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.21ms. Allocated memory is still 167.8MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 16:00:29,132 INFO L158 Benchmark]: Boogie Preprocessor took 41.74ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 129.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 16:00:29,132 INFO L158 Benchmark]: RCFGBuilder took 584.30ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 91.3MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-11 16:00:29,132 INFO L158 Benchmark]: TraceAbstraction took 3492.60ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 90.3MB in the beginning and 94.5MB in the end (delta: -4.2MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2024-11-11 16:00:29,133 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 216.0MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:00:29,135 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.13ms. Allocated memory is still 130.0MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.43ms. Allocated memory was 130.0MB in the beginning and 167.8MB in the end (delta: 37.7MB). Free memory was 72.7MB in the beginning and 135.3MB in the end (delta: -62.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.21ms. Allocated memory is still 167.8MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.74ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 129.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 584.30ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 91.3MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3492.60ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 90.3MB in the beginning and 94.5MB in the end (delta: -4.2MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 216.0MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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] [L109] COND TRUE 1 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=4, s__bbio=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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=0, 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=1, 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, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 980 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 980 mSDsluCounter, 4509 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2655 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1455 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 1854 mSDtfsCounter, 1455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=6, InterpolantAutomatonStates: 36, 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, 9 MinimizatonAttempts, 198 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 1910 SizeOfPredicates, 2 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 254/404 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-11 16:00:29,160 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/11.0.12-open/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.5.800.v20200727-1323.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.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:00:30,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:00:30,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 16:00:30,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:00:30,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:00:30,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:00:30,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:00:30,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:00:30,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:00:30,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:00:30,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:00:30,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:00:30,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:00:30,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:00:30,976 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:00:30,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:00:30,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:00:30,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:00:30,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:00:30,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:00:30,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:00:30,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:00:30,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:00:30,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:00:30,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:00:30,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:00:30,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:00:30,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:30,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:00:30,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:00:30,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:00:30,982 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 16:00:30,982 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 16:00:30,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:00:30,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:00:30,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:00:30,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:00:30,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-11 16:00:31,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:00:31,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:00:31,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:00:31,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:00:31,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:00:31,253 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 [2024-11-11 16:00:32,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:00:32,688 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:00:32,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-11 16:00:32,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c2de781/4eccb7952182405f99719b5bd7221964/FLAG53a65cd70 [2024-11-11 16:00:32,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c2de781/4eccb7952182405f99719b5bd7221964 [2024-11-11 16:00:32,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:00:32,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:00:32,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:32,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:00:32,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:00:32,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:32" (1/1) ... [2024-11-11 16:00:32,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e102525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:32, skipping insertion in model container [2024-11-11 16:00:32,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:00:32" (1/1) ... [2024-11-11 16:00:32,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:00:32,977 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] [2024-11-11 16:00:32,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:33,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:00:33,039 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] [2024-11-11 16:00:33,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:00:33,055 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:00:33,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33 WrapperNode [2024-11-11 16:00:33,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:00:33,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:33,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:00:33,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:00:33,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,092 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-11-11 16:00:33,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:00:33,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:00:33,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:00:33,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:00:33,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,126 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]. [2024-11-11 16:00:33,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:00:33,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:00:33,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:00:33,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:00:33,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (1/1) ... [2024-11-11 16:00:33,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:00:33,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:00:33,180 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) [2024-11-11 16:00:33,182 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 [2024-11-11 16:00:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:00:33,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 16:00:33,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:00:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:00:33,303 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:00:33,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:00:33,322 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-11 16:00:33,670 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-11 16:00:33,670 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-11 16:00:33,718 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-11 16:00:33,719 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:00:33,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:00:33,732 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:00:33,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:33 BoogieIcfgContainer [2024-11-11 16:00:33,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:00:33,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:00:33,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:00:33,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:00:33,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:00:32" (1/3) ... [2024-11-11 16:00:33,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73630c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:33, skipping insertion in model container [2024-11-11 16:00:33,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:00:33" (2/3) ... [2024-11-11 16:00:33,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73630c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:00:33, skipping insertion in model container [2024-11-11 16:00:33,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:33" (3/3) ... [2024-11-11 16:00:33,740 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-11-11 16:00:33,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:00:33,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:00:33,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:00:33,810 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;@223018ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:00:33,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:00:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 16:00:33,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:33,819 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, 1] [2024-11-11 16:00:33,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash 259999105, now seen corresponding path program 1 times [2024-11-11 16:00:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:33,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043342528] [2024-11-11 16:00:33,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:33,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:33,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:33,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:33,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 16:00:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:33,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:33,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:33,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:33,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043342528] [2024-11-11 16:00:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043342528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206314113] [2024-11-11 16:00:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:33,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:33,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:33,947 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-11 16:00:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:34,092 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2024-11-11 16:00:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:34,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2024-11-11 16:00:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:34,114 INFO L225 Difference]: With dead ends: 247 [2024-11-11 16:00:34,114 INFO L226 Difference]: Without dead ends: 113 [2024-11-11 16:00:34,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:34,119 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 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 [2024-11-11 16:00:34,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-11 16:00:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-11 16:00:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 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) [2024-11-11 16:00:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-11-11 16:00:34,156 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2024-11-11 16:00:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:34,156 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-11-11 16:00:34,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-11 16:00:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-11-11 16:00:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 16:00:34,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:34,158 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:00:34,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 16:00:34,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:34,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:34,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1138040513, now seen corresponding path program 1 times [2024-11-11 16:00:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:34,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143789858] [2024-11-11 16:00:34,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:34,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:34,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:34,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:34,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 16:00:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:34,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:34,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:34,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:34,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143789858] [2024-11-11 16:00:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143789858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:34,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:34,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838912649] [2024-11-11 16:00:34,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:34,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:34,459 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-11-11 16:00:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:34,567 INFO L93 Difference]: Finished difference Result 230 states and 352 transitions. [2024-11-11 16:00:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:34,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2024-11-11 16:00:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:34,568 INFO L225 Difference]: With dead ends: 230 [2024-11-11 16:00:34,569 INFO L226 Difference]: Without dead ends: 128 [2024-11-11 16:00:34,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:34,570 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 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 [2024-11-11 16:00:34,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-11 16:00:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-11 16:00:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 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) [2024-11-11 16:00:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-11-11 16:00:34,579 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 37 [2024-11-11 16:00:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:34,580 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-11-11 16:00:34,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-11-11 16:00:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-11-11 16:00:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 16:00:34,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:34,581 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:00:34,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 16:00:34,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:34,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:34,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1126420040, now seen corresponding path program 1 times [2024-11-11 16:00:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965743651] [2024-11-11 16:00:34,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:34,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:34,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 16:00:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:34,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:34,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:34,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:34,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965743651] [2024-11-11 16:00:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965743651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:34,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:34,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804638891] [2024-11-11 16:00:34,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:34,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:34,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:34,888 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:34,915 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2024-11-11 16:00:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:34,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2024-11-11 16:00:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:34,918 INFO L225 Difference]: With dead ends: 271 [2024-11-11 16:00:34,918 INFO L226 Difference]: Without dead ends: 154 [2024-11-11 16:00:34,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:34,919 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:34,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-11 16:00:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-11 16:00:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-11 16:00:34,929 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 51 [2024-11-11 16:00:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:34,930 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-11 16:00:34,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-11 16:00:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 16:00:34,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:34,931 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 16:00:34,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-11 16:00:35,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:35,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:35,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1260433546, now seen corresponding path program 1 times [2024-11-11 16:00:35,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:35,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80495356] [2024-11-11 16:00:35,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:35,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:35,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:35,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:35,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-11 16:00:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:35,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:35,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:35,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:35,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80495356] [2024-11-11 16:00:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80495356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591067188] [2024-11-11 16:00:35,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:35,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:35,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:35,229 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:35,326 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2024-11-11 16:00:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:35,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 51 [2024-11-11 16:00:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:35,328 INFO L225 Difference]: With dead ends: 288 [2024-11-11 16:00:35,328 INFO L226 Difference]: Without dead ends: 171 [2024-11-11 16:00:35,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:35,330 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 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 [2024-11-11 16:00:35,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-11 16:00:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-11 16:00:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 170 states have internal predecessors, (246), 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) [2024-11-11 16:00:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2024-11-11 16:00:35,337 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 51 [2024-11-11 16:00:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:35,337 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2024-11-11 16:00:35,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-11-11 16:00:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2024-11-11 16:00:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 16:00:35,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:35,339 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:35,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-11 16:00:35,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:35,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:35,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash -457628469, now seen corresponding path program 1 times [2024-11-11 16:00:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:35,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952830367] [2024-11-11 16:00:35,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:35,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-11 16:00:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:35,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:00:35,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:35,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:35,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952830367] [2024-11-11 16:00:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952830367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:35,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:00:35,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-11 16:00:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943079408] [2024-11-11 16:00:35,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 16:00:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 16:00:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:00:35,941 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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) [2024-11-11 16:00:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:36,313 INFO L93 Difference]: Finished difference Result 556 states and 838 transitions. [2024-11-11 16:00:36,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 16:00:36,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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 68 [2024-11-11 16:00:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:36,315 INFO L225 Difference]: With dead ends: 556 [2024-11-11 16:00:36,316 INFO L226 Difference]: Without dead ends: 421 [2024-11-11 16:00:36,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-11 16:00:36,320 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 444 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:36,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 378 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:00:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-11 16:00:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2024-11-11 16:00:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4521531100478469) internal successors, (607), 418 states have internal predecessors, (607), 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) [2024-11-11 16:00:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 607 transitions. [2024-11-11 16:00:36,348 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 607 transitions. Word has length 68 [2024-11-11 16:00:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:36,351 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 607 transitions. [2024-11-11 16:00:36,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 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) [2024-11-11 16:00:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 607 transitions. [2024-11-11 16:00:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 16:00:36,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:36,353 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:36,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-11 16:00:36,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:36,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:36,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2031900493, now seen corresponding path program 1 times [2024-11-11 16:00:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55807440] [2024-11-11 16:00:36,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:36,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:36,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:36,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-11 16:00:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:36,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:36,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:36,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:36,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55807440] [2024-11-11 16:00:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55807440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:36,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:36,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062998391] [2024-11-11 16:00:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:36,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:36,650 INFO L87 Difference]: Start difference. First operand 419 states and 607 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) [2024-11-11 16:00:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:36,667 INFO L93 Difference]: Finished difference Result 927 states and 1364 transitions. [2024-11-11 16:00:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:36,668 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 68 [2024-11-11 16:00:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:36,670 INFO L225 Difference]: With dead ends: 927 [2024-11-11 16:00:36,670 INFO L226 Difference]: Without dead ends: 574 [2024-11-11 16:00:36,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:36,671 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 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 [2024-11-11 16:00:36,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-11 16:00:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-11-11 16:00:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4623467600700526) internal successors, (835), 571 states have internal predecessors, (835), 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) [2024-11-11 16:00:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 835 transitions. [2024-11-11 16:00:36,706 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 835 transitions. Word has length 68 [2024-11-11 16:00:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:36,706 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 835 transitions. [2024-11-11 16:00:36,707 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) [2024-11-11 16:00:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 835 transitions. [2024-11-11 16:00:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 16:00:36,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:36,711 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:36,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-11 16:00:36,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:36,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:36,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash -875025075, now seen corresponding path program 1 times [2024-11-11 16:00:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97779669] [2024-11-11 16:00:36,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:36,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:36,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-11 16:00:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:36,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:36,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 16:00:37,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:37,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:37,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97779669] [2024-11-11 16:00:37,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97779669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:37,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:37,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:37,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121226872] [2024-11-11 16:00:37,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:37,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:37,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:37,027 INFO L87 Difference]: Start difference. First operand 572 states and 835 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) [2024-11-11 16:00:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:37,044 INFO L93 Difference]: Finished difference Result 576 states and 837 transitions. [2024-11-11 16:00:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:37,044 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 68 [2024-11-11 16:00:37,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:37,049 INFO L225 Difference]: With dead ends: 576 [2024-11-11 16:00:37,049 INFO L226 Difference]: Without dead ends: 419 [2024-11-11 16:00:37,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:37,050 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 399 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 [2024-11-11 16:00:37,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 399 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-11 16:00:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-11 16:00:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.4375) internal successors, (598), 416 states have internal predecessors, (598), 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) [2024-11-11 16:00:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 598 transitions. [2024-11-11 16:00:37,058 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 598 transitions. Word has length 68 [2024-11-11 16:00:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 598 transitions. [2024-11-11 16:00:37,058 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) [2024-11-11 16:00:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 598 transitions. [2024-11-11 16:00:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 16:00:37,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:37,059 INFO L218 NwaCegarLoop]: trace histogram [4, 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] [2024-11-11 16:00:37,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-11 16:00:37,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:37,260 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:37,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1614503887, now seen corresponding path program 1 times [2024-11-11 16:00:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418971306] [2024-11-11 16:00:37,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:37,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:37,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:37,276 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:37,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-11 16:00:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:37,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 16:00:37,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:37,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 16:00:37,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418971306] [2024-11-11 16:00:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418971306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:37,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:00:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-11 16:00:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314603245] [2024-11-11 16:00:37,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:37,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:00:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:00:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:00:37,581 INFO L87 Difference]: Start difference. First operand 417 states and 598 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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) [2024-11-11 16:00:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:37,953 INFO L93 Difference]: Finished difference Result 636 states and 943 transitions. [2024-11-11 16:00:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 16:00:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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 68 [2024-11-11 16:00:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:37,955 INFO L225 Difference]: With dead ends: 636 [2024-11-11 16:00:37,955 INFO L226 Difference]: Without dead ends: 480 [2024-11-11 16:00:37,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-11 16:00:37,955 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 255 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:00:37,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1236 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:00:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-11 16:00:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2024-11-11 16:00:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 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) [2024-11-11 16:00:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 667 transitions. [2024-11-11 16:00:37,964 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 667 transitions. Word has length 68 [2024-11-11 16:00:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:37,964 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 667 transitions. [2024-11-11 16:00:37,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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) [2024-11-11 16:00:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 667 transitions. [2024-11-11 16:00:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 16:00:37,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:37,965 INFO L218 NwaCegarLoop]: trace histogram [5, 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] [2024-11-11 16:00:37,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-11 16:00:38,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:38,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:38,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:38,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1844660206, now seen corresponding path program 1 times [2024-11-11 16:00:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259013756] [2024-11-11 16:00:38,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:38,168 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:38,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-11 16:00:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:38,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:38,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-11 16:00:38,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:38,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259013756] [2024-11-11 16:00:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259013756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773384094] [2024-11-11 16:00:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:38,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:38,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:38,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:38,238 INFO L87 Difference]: Start difference. First operand 476 states and 667 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2024-11-11 16:00:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:38,334 INFO L93 Difference]: Finished difference Result 928 states and 1325 transitions. [2024-11-11 16:00:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 85 [2024-11-11 16:00:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:38,336 INFO L225 Difference]: With dead ends: 928 [2024-11-11 16:00:38,336 INFO L226 Difference]: Without dead ends: 518 [2024-11-11 16:00:38,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:38,337 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 259 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 [2024-11-11 16:00:38,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 259 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 16:00:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-11 16:00:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2024-11-11 16:00:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.390715667311412) internal successors, (719), 517 states have internal predecessors, (719), 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) [2024-11-11 16:00:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 719 transitions. [2024-11-11 16:00:38,348 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 719 transitions. Word has length 85 [2024-11-11 16:00:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 719 transitions. [2024-11-11 16:00:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2024-11-11 16:00:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 719 transitions. [2024-11-11 16:00:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 16:00:38,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:38,351 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2024-11-11 16:00:38,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-11 16:00:38,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:38,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:38,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2022672797, now seen corresponding path program 1 times [2024-11-11 16:00:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332061426] [2024-11-11 16:00:38,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:38,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:38,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-11 16:00:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:00:38,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:00:38,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 16:00:38,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:00:38,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:38,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332061426] [2024-11-11 16:00:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332061426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:00:38,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:00:38,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:00:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265851770] [2024-11-11 16:00:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:00:38,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:00:38,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:38,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:00:38,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:38,646 INFO L87 Difference]: Start difference. First operand 518 states and 719 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:00:38,686 INFO L93 Difference]: Finished difference Result 1416 states and 1982 transitions. [2024-11-11 16:00:38,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:00:38,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-11 16:00:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:00:38,691 INFO L225 Difference]: With dead ends: 1416 [2024-11-11 16:00:38,691 INFO L226 Difference]: Without dead ends: 964 [2024-11-11 16:00:38,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:00:38,692 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 121 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 359 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 [2024-11-11 16:00:38,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 16:00:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-11 16:00:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2024-11-11 16:00:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3881373569198752) internal successors, (1334), 961 states have internal predecessors, (1334), 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) [2024-11-11 16:00:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1334 transitions. [2024-11-11 16:00:38,710 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1334 transitions. Word has length 104 [2024-11-11 16:00:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:00:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1334 transitions. [2024-11-11 16:00:38,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:00:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1334 transitions. [2024-11-11 16:00:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 16:00:38,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:00:38,712 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2024-11-11 16:00:38,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-11 16:00:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:38,916 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:00:38,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:00:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1888659291, now seen corresponding path program 1 times [2024-11-11 16:00:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 16:00:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967214885] [2024-11-11 16:00:38,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:00:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 16:00:38,919 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 16:00:38,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-11 16:00:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:00:38,963 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 16:00:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 16:00:39,033 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-11 16:00:39,033 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 16:00:39,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:00:39,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-11 16:00:39,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 16:00:39,238 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:00:39,315 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:00:39,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:00:39 BoogieIcfgContainer [2024-11-11 16:00:39,318 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:00:39,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:00:39,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:00:39,319 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:00:39,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:00:33" (3/4) ... [2024-11-11 16:00:39,320 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 16:00:39,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:00:39,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:00:39,392 INFO L158 Benchmark]: Toolchain (without parser) took 6673.09ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 35.8MB in the beginning and 37.8MB in the end (delta: -2.0MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,392 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 75.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:00:39,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.19ms. Allocated memory is still 75.5MB. Free memory was 35.6MB in the beginning and 39.5MB in the end (delta: -4.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 36.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,392 INFO L158 Benchmark]: Boogie Preprocessor took 49.17ms. Allocated memory is still 75.5MB. Free memory was 36.6MB in the beginning and 33.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,393 INFO L158 Benchmark]: RCFGBuilder took 590.13ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 33.5MB in the beginning and 68.2MB in the end (delta: -34.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,393 INFO L158 Benchmark]: TraceAbstraction took 5584.65ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 67.6MB in the beginning and 50.4MB in the end (delta: 17.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,393 INFO L158 Benchmark]: Witness Printer took 72.17ms. Allocated memory is still 119.5MB. Free memory was 50.4MB in the beginning and 37.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 16:00:39,395 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.11ms. Allocated memory is still 75.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.19ms. Allocated memory is still 75.5MB. Free memory was 35.6MB in the beginning and 39.5MB in the end (delta: -4.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 36.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.17ms. Allocated memory is still 75.5MB. Free memory was 36.6MB in the beginning and 33.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.13ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 33.5MB in the beginning and 68.2MB in the end (delta: -34.7MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5584.65ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 67.6MB in the beginning and 50.4MB in the end (delta: 17.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 72.17ms. Allocated memory is still 119.5MB. Free memory was 50.4MB in the beginning and 37.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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=2, ret=-1, s__state=12292, skip=0] [L93] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=2, ret=-1, s__in_handshake=0, s__state=12292, skip=0] [L94] COND FALSE !(tmp___1 + 12288) VAL [blastFlag=0, cb=2, ret=-1, s__in_handshake=0, s__state=12292, skip=0] [L103] COND FALSE !(\read(s__hit)) [L106] ag_Z = 48 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0] [L109] COND TRUE 1 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0] [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0, state=12292] [L112] COND TRUE s__state == 12292 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, 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=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L222] s__server = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L223] COND TRUE cb != 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, 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=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__version=-64512, skip=0, state=12292] [L253] COND FALSE !(! tmp___4) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__version=-64512, skip=0, state=12292, tmp___4=2] [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=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L127] COND TRUE s__state == 4368 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Z=48, blastFlag=1, cb=2, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [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=2, ret=2, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4352, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L310] COND FALSE !(\read(s__hit)) [L313] s__state = s__state | ag_Z VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L315] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L139] COND TRUE s__state == 4400 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [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=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L334] s__state = 4416 [L335] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L145] COND TRUE s__state == 4416 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L339] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L340] COND FALSE !(blastFlag == 3) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L345] COND FALSE !(ret <= 0) [L350] s__state = 4432 [L351] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L352] COND FALSE !(! tmp___6) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Z=48, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L624] reach_error() VAL [ag_X=4352, ag_Z=48, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1122 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1122 mSDsluCounter, 4082 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2180 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1299 IncrementalHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 1902 mSDtfsCounter, 1299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=962occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 749 ConstructedInterpolants, 59 QuantifiedInterpolants, 2007 SizeOfPredicates, 5 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 383/496 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-11 16:00:39,420 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