./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.fs.cvc5-61a6796-m [2024-10-13 22:39:13,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:14,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:39:14,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:14,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:14,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:14,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:14,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:14,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:14,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:14,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:14,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:14,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:14,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:14,103 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:14,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:14,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:14,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:14,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:39:14,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:14,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:14,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:14,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:14,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:14,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:14,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:14,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:14,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:14,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:14,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:14,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:14,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:14,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:14,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:14,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:14,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:14,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:39:14,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:39:14,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:14,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:14,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:14,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:14,113 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-10-13 22:39:14,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:14,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:14,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:14,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:14,405 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:14,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-13 22:39:15,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:39:16,071 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:39:16,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-13 22:39:16,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a16efd9/d4760cf96a5f4c1abd6545ecbab50719/FLAG6557bff25 [2024-10-13 22:39:16,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a16efd9/d4760cf96a5f4c1abd6545ecbab50719 [2024-10-13 22:39:16,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:39:16,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:39:16,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:16,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:39:16,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:39:16,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f61f4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16, skipping insertion in model container [2024-10-13 22:39:16,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:39:16,370 WARN L248 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-10-13 22:39:16,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:16,398 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:39:16,443 WARN L248 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-10-13 22:39:16,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:16,468 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:39:16,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16 WrapperNode [2024-10-13 22:39:16,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:16,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:16,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:39:16,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:39:16,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,522 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2024-10-13 22:39:16,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:16,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:39:16,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:39:16,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:39:16,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,559 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-10-13 22:39:16,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:39:16,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:39:16,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:39:16,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:39:16,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (1/1) ... [2024-10-13 22:39:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:16,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:16,642 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-10-13 22:39:16,649 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-10-13 22:39:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:39:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:39:16,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:39:16,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:39:16,809 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:39:16,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:39:16,823 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 22:39:17,291 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-10-13 22:39:17,291 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-10-13 22:39:17,361 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 22:39:17,362 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:39:17,405 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:39:17,405 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:39:17,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:17 BoogieIcfgContainer [2024-10-13 22:39:17,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:39:17,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:39:17,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:39:17,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:39:17,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:16" (1/3) ... [2024-10-13 22:39:17,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309cf406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:17, skipping insertion in model container [2024-10-13 22:39:17,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:16" (2/3) ... [2024-10-13 22:39:17,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309cf406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:17, skipping insertion in model container [2024-10-13 22:39:17,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:17" (3/3) ... [2024-10-13 22:39:17,414 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-10-13 22:39:17,429 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:39:17,430 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:39:17,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:39:17,502 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;@51f51c75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:39:17,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:39:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.76) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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-10-13 22:39:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:39:17,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:17,515 INFO L215 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] [2024-10-13 22:39:17,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:17,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1091064671, now seen corresponding path program 1 times [2024-10-13 22:39:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805233118] [2024-10-13 22:39:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:17,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805233118] [2024-10-13 22:39:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805233118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623564738] [2024-10-13 22:39:17,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:17,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:17,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:17,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:17,809 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.76) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:17,978 INFO L93 Difference]: Finished difference Result 249 states and 433 transitions. [2024-10-13 22:39:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:17,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 22:39:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:17,991 INFO L225 Difference]: With dead ends: 249 [2024-10-13 22:39:17,991 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 22:39:17,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-13 22:39:18,001 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 22:39:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-13 22:39:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.543103448275862) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2024-10-13 22:39:18,041 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 23 [2024-10-13 22:39:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,041 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2024-10-13 22:39:18,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2024-10-13 22:39:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 22:39:18,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,043 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:18,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:39:18,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1983510372, now seen corresponding path program 1 times [2024-10-13 22:39:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817489548] [2024-10-13 22:39:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817489548] [2024-10-13 22:39:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817489548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014470653] [2024-10-13 22:39:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:18,149 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10-13 22:39:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,310 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-10-13 22:39:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-13 22:39:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,313 INFO L225 Difference]: With dead ends: 239 [2024-10-13 22:39:18,313 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 22:39:18,313 INFO L431 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-10-13 22:39:18,315 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 248 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:18,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 22:39:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-13 22:39:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.523076923076923) internal successors, (198), 130 states have internal predecessors, (198), 0 states have call successors, (0), 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-10-13 22:39:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-10-13 22:39:18,328 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 33 [2024-10-13 22:39:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,329 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-10-13 22:39:18,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10-13 22:39:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-10-13 22:39:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:18,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,331 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:18,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:39:18,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2051034107, now seen corresponding path program 1 times [2024-10-13 22:39:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939800804] [2024-10-13 22:39:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:39:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939800804] [2024-10-13 22:39:18,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939800804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:18,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:18,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066526577] [2024-10-13 22:39:18,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:18,435 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,461 INFO L93 Difference]: Finished difference Result 277 states and 414 transitions. [2024-10-13 22:39:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-13 22:39:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,463 INFO L225 Difference]: With dead ends: 277 [2024-10-13 22:39:18,463 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 22:39:18,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-13 22:39:18,465 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 21 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 324 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 22:39:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-13 22:39:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 154 states have internal predecessors, (229), 0 states have call successors, (0), 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-10-13 22:39:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-13 22:39:18,478 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 46 [2024-10-13 22:39:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,479 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-13 22:39:18,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-13 22:39:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:18,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,483 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:18,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:39:18,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash -438494855, now seen corresponding path program 1 times [2024-10-13 22:39:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343303132] [2024-10-13 22:39:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:39:18,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343303132] [2024-10-13 22:39:18,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343303132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:18,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:18,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:18,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512900530] [2024-10-13 22:39:18,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:18,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:18,603 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,737 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2024-10-13 22:39:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-13 22:39:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,739 INFO L225 Difference]: With dead ends: 293 [2024-10-13 22:39:18,741 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 22:39:18,742 INFO L431 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-10-13 22:39:18,743 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 261 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 22:39:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-13 22:39:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 170 states have internal predecessors, (250), 0 states have call successors, (0), 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-10-13 22:39:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2024-10-13 22:39:18,764 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 46 [2024-10-13 22:39:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,764 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2024-10-13 22:39:18,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2024-10-13 22:39:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 22:39:18,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,767 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:18,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:39:18,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1782095985, now seen corresponding path program 1 times [2024-10-13 22:39:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497388733] [2024-10-13 22:39:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:18,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:18,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497388733] [2024-10-13 22:39:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497388733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064908241] [2024-10-13 22:39:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:18,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:18,852 INFO L87 Difference]: Start difference. First operand 171 states and 250 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:18,881 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2024-10-13 22:39:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 22:39:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:18,884 INFO L225 Difference]: With dead ends: 464 [2024-10-13 22:39:18,884 INFO L226 Difference]: Without dead ends: 326 [2024-10-13 22:39:18,885 INFO L431 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-10-13 22:39:18,886 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:18,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 330 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-13 22:39:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-10-13 22:39:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4551083591331269) internal successors, (470), 323 states have internal predecessors, (470), 0 states have call successors, (0), 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-10-13 22:39:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2024-10-13 22:39:18,902 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 64 [2024-10-13 22:39:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:18,903 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2024-10-13 22:39:18,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2024-10-13 22:39:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 22:39:18,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:18,905 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:39:18,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1762519458, now seen corresponding path program 1 times [2024-10-13 22:39:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:18,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550564945] [2024-10-13 22:39:18,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:19,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550564945] [2024-10-13 22:39:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550564945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568364917] [2024-10-13 22:39:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:19,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:19,047 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-10-13 22:39:19,051 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-10-13 22:39:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:19,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:39:19,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:19,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568364917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:19,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 22:39:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450113309] [2024-10-13 22:39:19,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:19,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:39:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:19,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:39:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:39:19,437 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 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-10-13 22:39:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:19,972 INFO L93 Difference]: Finished difference Result 967 states and 1518 transitions. [2024-10-13 22:39:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 22:39:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:19,975 INFO L225 Difference]: With dead ends: 967 [2024-10-13 22:39:19,976 INFO L226 Difference]: Without dead ends: 577 [2024-10-13 22:39:19,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:39:19,978 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 284 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:19,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 925 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:39:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-13 22:39:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 569. [2024-10-13 22:39:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4419014084507042) internal successors, (819), 568 states have internal predecessors, (819), 0 states have call successors, (0), 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-10-13 22:39:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 819 transitions. [2024-10-13 22:39:20,012 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 819 transitions. Word has length 64 [2024-10-13 22:39:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:20,012 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 819 transitions. [2024-10-13 22:39:20,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 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-10-13 22:39:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 819 transitions. [2024-10-13 22:39:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 22:39:20,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:20,015 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:20,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:39:20,216 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-10-13 22:39:20,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:20,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1580272051, now seen corresponding path program 1 times [2024-10-13 22:39:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103212488] [2024-10-13 22:39:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,384 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103212488] [2024-10-13 22:39:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103212488] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:20,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64741970] [2024-10-13 22:39:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:20,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:20,388 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-10-13 22:39:20,390 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-10-13 22:39:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:20,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 22:39:20,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:20,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64741970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:20,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-13 22:39:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322283013] [2024-10-13 22:39:20,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:39:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:39:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:39:20,661 INFO L87 Difference]: Start difference. First operand 569 states and 819 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 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-10-13 22:39:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:21,074 INFO L93 Difference]: Finished difference Result 1298 states and 1890 transitions. [2024-10-13 22:39:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:39:21,075 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 22:39:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:21,078 INFO L225 Difference]: With dead ends: 1298 [2024-10-13 22:39:21,079 INFO L226 Difference]: Without dead ends: 746 [2024-10-13 22:39:21,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 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-10-13 22:39:21,081 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 450 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:21,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 886 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:39:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-13 22:39:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 569. [2024-10-13 22:39:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4383802816901408) internal successors, (817), 568 states have internal predecessors, (817), 0 states have call successors, (0), 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-10-13 22:39:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 817 transitions. [2024-10-13 22:39:21,100 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 817 transitions. Word has length 64 [2024-10-13 22:39:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 817 transitions. [2024-10-13 22:39:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 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-10-13 22:39:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 817 transitions. [2024-10-13 22:39:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 22:39:21,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:21,102 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:21,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 22:39:21,303 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-10-13 22:39:21,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:21,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1560695524, now seen corresponding path program 1 times [2024-10-13 22:39:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:21,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876367507] [2024-10-13 22:39:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876367507] [2024-10-13 22:39:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876367507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670078362] [2024-10-13 22:39:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:21,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:21,350 INFO L87 Difference]: Start difference. First operand 569 states and 817 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:21,373 INFO L93 Difference]: Finished difference Result 747 states and 1069 transitions. [2024-10-13 22:39:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:21,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-13 22:39:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:21,376 INFO L225 Difference]: With dead ends: 747 [2024-10-13 22:39:21,376 INFO L226 Difference]: Without dead ends: 400 [2024-10-13 22:39:21,377 INFO L431 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-10-13 22:39:21,377 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 124 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:21,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 467 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-13 22:39:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2024-10-13 22:39:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4253164556962026) internal successors, (563), 395 states have internal predecessors, (563), 0 states have call successors, (0), 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-10-13 22:39:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 563 transitions. [2024-10-13 22:39:21,386 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 563 transitions. Word has length 64 [2024-10-13 22:39:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:21,386 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 563 transitions. [2024-10-13 22:39:21,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 563 transitions. [2024-10-13 22:39:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 22:39:21,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:21,387 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:39:21,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash 719605973, now seen corresponding path program 1 times [2024-10-13 22:39:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227355456] [2024-10-13 22:39:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:21,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227355456] [2024-10-13 22:39:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227355456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:21,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:21,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898390318] [2024-10-13 22:39:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:21,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:21,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:21,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:21,440 INFO L87 Difference]: Start difference. First operand 396 states and 563 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-13 22:39:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:21,456 INFO L93 Difference]: Finished difference Result 571 states and 812 transitions. [2024-10-13 22:39:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 65 [2024-10-13 22:39:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:21,458 INFO L225 Difference]: With dead ends: 571 [2024-10-13 22:39:21,458 INFO L226 Difference]: Without dead ends: 398 [2024-10-13 22:39:21,459 INFO L431 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-10-13 22:39:21,459 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 125 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:21,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 320 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-13 22:39:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2024-10-13 22:39:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4227848101265823) internal successors, (562), 395 states have internal predecessors, (562), 0 states have call successors, (0), 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-10-13 22:39:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 562 transitions. [2024-10-13 22:39:21,468 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 562 transitions. Word has length 65 [2024-10-13 22:39:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:21,468 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 562 transitions. [2024-10-13 22:39:21,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-13 22:39:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 562 transitions. [2024-10-13 22:39:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 22:39:21,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:21,469 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:21,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:39:21,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -204590847, now seen corresponding path program 1 times [2024-10-13 22:39:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890295220] [2024-10-13 22:39:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:21,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 22:39:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:21,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 22:39:21,533 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 22:39:21,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:39:21,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 22:39:21,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:21,616 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:39:21,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:21 BoogieIcfgContainer [2024-10-13 22:39:21,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:39:21,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:39:21,619 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:39:21,620 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:39:21,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:17" (3/4) ... [2024-10-13 22:39:21,622 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 22:39:21,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:39:21,623 INFO L158 Benchmark]: Toolchain (without parser) took 5503.55ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 114.5MB in the beginning and 75.9MB in the end (delta: 38.7MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,623 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:21,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.82ms. Allocated memory is still 163.6MB. Free memory was 114.5MB in the beginning and 97.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.71ms. Allocated memory is still 163.6MB. Free memory was 97.8MB in the beginning and 94.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,624 INFO L158 Benchmark]: Boogie Preprocessor took 69.46ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 92.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,624 INFO L158 Benchmark]: RCFGBuilder took 812.99ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 119.4MB in the end (delta: -27.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,625 INFO L158 Benchmark]: TraceAbstraction took 4210.74ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 118.5MB in the beginning and 76.9MB in the end (delta: 41.6MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,625 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 245.4MB. Free memory was 76.9MB in the beginning and 75.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:21,626 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.82ms. Allocated memory is still 163.6MB. Free memory was 114.5MB in the beginning and 97.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.71ms. Allocated memory is still 163.6MB. Free memory was 97.8MB in the beginning and 94.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.46ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 92.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 812.99ms. Allocated memory is still 163.6MB. Free memory was 91.5MB in the beginning and 119.4MB in the end (delta: -27.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4210.74ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 118.5MB in the beginning and 76.9MB in the end (delta: 41.6MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 245.4MB. Free memory was 76.9MB in the beginning and 75.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 [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 [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 [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 [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 [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, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1160 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 4080 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2299 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1465 IncrementalHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 1781 mSDtfsCounter, 1465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred 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, 193 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1740 SizeOfPredicates, 2 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 211/343 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-10-13 22:39:21,679 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/current/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 /storage/repos/ultimate/releaseScripts/default/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.fs.cvc5-61a6796-m [2024-10-13 22:39:23,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:23,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 22:39:23,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:23,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:23,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:23,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:23,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:23,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:23,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:23,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:23,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:23,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:23,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:23,967 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:23,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:23,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:23,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:23,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:23,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:23,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:23,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:23,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:23,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 22:39:23,974 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 22:39:23,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:23,974 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 22:39:23,974 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:23,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:23,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:23,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:23,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:23,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:23,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:23,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:23,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:23,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:23,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:23,980 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 22:39:23,980 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-13 22:39:23,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:23,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:23,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:23,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:23,982 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 22:39:23,982 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-10-13 22:39:24,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:24,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:24,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:24,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:24,331 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:24,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-13 22:39:25,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:39:26,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:39:26,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-13 22:39:26,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd4a3a52/e98c3d9d09df4aa18301fe194671212a/FLAG2cc5bdca1 [2024-10-13 22:39:26,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cd4a3a52/e98c3d9d09df4aa18301fe194671212a [2024-10-13 22:39:26,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:39:26,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:39:26,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:26,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:39:26,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:39:26,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679a3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26, skipping insertion in model container [2024-10-13 22:39:26,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:39:26,449 WARN L248 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-10-13 22:39:26,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:26,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:39:26,539 WARN L248 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-10-13 22:39:26,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:26,570 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:39:26,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26 WrapperNode [2024-10-13 22:39:26,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:26,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:26,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:39:26,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:39:26,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,631 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-10-13 22:39:26,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:26,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:39:26,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:39:26,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:39:26,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,678 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-10-13 22:39:26,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:39:26,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:39:26,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:39:26,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:39:26,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (1/1) ... [2024-10-13 22:39:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:26,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:26,752 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-10-13 22:39:26,758 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-10-13 22:39:26,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:39:26,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 22:39:26,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:39:26,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:39:26,909 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:39:26,911 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:39:26,933 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 22:39:27,405 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-10-13 22:39:27,405 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-10-13 22:39:27,466 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-13 22:39:27,466 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:39:27,501 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:39:27,502 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:39:27,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:27 BoogieIcfgContainer [2024-10-13 22:39:27,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:39:27,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:39:27,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:39:27,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:39:27,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:26" (1/3) ... [2024-10-13 22:39:27,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d3a8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:27, skipping insertion in model container [2024-10-13 22:39:27,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:26" (2/3) ... [2024-10-13 22:39:27,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d3a8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:27, skipping insertion in model container [2024-10-13 22:39:27,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:27" (3/3) ... [2024-10-13 22:39:27,511 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-10-13 22:39:27,527 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:39:27,527 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:39:27,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:39:27,611 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;@c81f4df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:39:27,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:39:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 117 states have (on average 1.7777777777777777) internal successors, (208), 118 states have internal predecessors, (208), 0 states have call successors, (0), 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-10-13 22:39:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:39:27,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:27,623 INFO L215 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] [2024-10-13 22:39:27,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1053989179, now seen corresponding path program 1 times [2024-10-13 22:39:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673251854] [2024-10-13 22:39:27,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,641 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-10-13 22:39:27,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:27,644 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-10-13 22:39:27,646 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-10-13 22:39:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:27,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:27,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:27,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:27,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673251854] [2024-10-13 22:39:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673251854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:27,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:27,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997349045] [2024-10-13 22:39:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:27,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:27,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:27,807 INFO L87 Difference]: Start difference. First operand has 119 states, 117 states have (on average 1.7777777777777777) internal successors, (208), 118 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:27,995 INFO L93 Difference]: Finished difference Result 233 states and 409 transitions. [2024-10-13 22:39:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 22:39:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:28,008 INFO L225 Difference]: With dead ends: 233 [2024-10-13 22:39:28,009 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 22:39:28,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:28,016 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:28,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 303 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:39:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 22:39:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 22:39:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 108 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2024-10-13 22:39:28,049 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 23 [2024-10-13 22:39:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:28,050 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2024-10-13 22:39:28,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2024-10-13 22:39:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 22:39:28,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:28,052 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:28,055 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-10-13 22:39:28,253 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-10-13 22:39:28,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:28,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash 433548802, now seen corresponding path program 1 times [2024-10-13 22:39:28,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:28,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345327152] [2024-10-13 22:39:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:28,258 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-10-13 22:39:28,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:28,262 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-10-13 22:39:28,263 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-10-13 22:39:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:28,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:28,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:28,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:28,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345327152] [2024-10-13 22:39:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345327152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:28,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095417486] [2024-10-13 22:39:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:28,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:28,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:28,349 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10-13 22:39:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:28,496 INFO L93 Difference]: Finished difference Result 223 states and 345 transitions. [2024-10-13 22:39:28,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-13 22:39:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:28,497 INFO L225 Difference]: With dead ends: 223 [2024-10-13 22:39:28,498 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 22:39:28,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-10-13 22:39:28,499 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:28,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 232 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 22:39:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-13 22:39:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.5245901639344261) internal successors, (186), 122 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 186 transitions. [2024-10-13 22:39:28,510 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 186 transitions. Word has length 33 [2024-10-13 22:39:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 186 transitions. [2024-10-13 22:39:28,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10-13 22:39:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 186 transitions. [2024-10-13 22:39:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:28,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:28,514 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:28,518 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:28,715 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-10-13 22:39:28,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:28,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1707743867, now seen corresponding path program 1 times [2024-10-13 22:39:28,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578029093] [2024-10-13 22:39:28,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:28,717 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-10-13 22:39:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:28,719 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-10-13 22:39:28,720 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-10-13 22:39:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:28,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:28,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:39:28,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:28,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578029093] [2024-10-13 22:39:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578029093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:28,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72972940] [2024-10-13 22:39:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:28,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:28,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:28,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:28,860 INFO L87 Difference]: Start difference. First operand 123 states and 186 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:28,891 INFO L93 Difference]: Finished difference Result 261 states and 390 transitions. [2024-10-13 22:39:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:28,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-13 22:39:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:28,895 INFO L225 Difference]: With dead ends: 261 [2024-10-13 22:39:28,895 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 22:39:28,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-10-13 22:39:28,897 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 21 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:28,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 300 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 22:39:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-13 22:39:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 146 states have internal predecessors, (217), 0 states have call successors, (0), 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-10-13 22:39:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-10-13 22:39:28,913 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 46 [2024-10-13 22:39:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:28,913 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-10-13 22:39:28,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-10-13 22:39:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 22:39:28,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:28,924 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:28,929 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:29,125 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-10-13 22:39:29,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -781785095, now seen corresponding path program 1 times [2024-10-13 22:39:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410780414] [2024-10-13 22:39:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:29,127 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-10-13 22:39:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:29,130 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-10-13 22:39:29,131 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-10-13 22:39:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:29,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:29,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:39:29,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:29,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:29,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410780414] [2024-10-13 22:39:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410780414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454774504] [2024-10-13 22:39:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:29,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:29,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:29,221 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:29,349 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2024-10-13 22:39:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:29,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-13 22:39:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:29,351 INFO L225 Difference]: With dead ends: 277 [2024-10-13 22:39:29,351 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 22:39:29,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-10-13 22:39:29,353 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:29,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 245 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 22:39:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-13 22:39:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 0 states have call successors, (0), 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-10-13 22:39:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2024-10-13 22:39:29,364 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 46 [2024-10-13 22:39:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:29,364 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2024-10-13 22:39:29,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-10-13 22:39:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2024-10-13 22:39:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 22:39:29,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:29,366 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:29,373 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-10-13 22:39:29,569 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-10-13 22:39:29,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -845701464, now seen corresponding path program 1 times [2024-10-13 22:39:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620514131] [2024-10-13 22:39:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:29,570 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-10-13 22:39:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:29,572 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-10-13 22:39:29,573 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-10-13 22:39:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:29,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:29,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:29,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:30,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:30,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620514131] [2024-10-13 22:39:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620514131] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:30,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:30,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 22:39:30,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928793658] [2024-10-13 22:39:30,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:30,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:30,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:30,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:30,080 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:30,562 INFO L93 Difference]: Finished difference Result 534 states and 816 transitions. [2024-10-13 22:39:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 22:39:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-13 22:39:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:30,565 INFO L225 Difference]: With dead ends: 534 [2024-10-13 22:39:30,565 INFO L226 Difference]: Without dead ends: 403 [2024-10-13 22:39:30,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 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-10-13 22:39:30,567 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 280 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:30,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 478 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:39:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-13 22:39:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2024-10-13 22:39:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.4725) internal successors, (589), 400 states have internal predecessors, (589), 0 states have call successors, (0), 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-10-13 22:39:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 589 transitions. [2024-10-13 22:39:30,593 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 589 transitions. Word has length 62 [2024-10-13 22:39:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:30,593 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 589 transitions. [2024-10-13 22:39:30,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 589 transitions. [2024-10-13 22:39:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 22:39:30,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:30,596 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:30,603 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-10-13 22:39:30,799 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-10-13 22:39:30,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -626846746, now seen corresponding path program 1 times [2024-10-13 22:39:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:30,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091630828] [2024-10-13 22:39:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:30,801 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-10-13 22:39:30,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:30,804 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-10-13 22:39:30,806 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-10-13 22:39:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:30,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:30,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:30,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:30,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091630828] [2024-10-13 22:39:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091630828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:30,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:30,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666971319] [2024-10-13 22:39:30,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:30,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:30,954 INFO L87 Difference]: Start difference. First operand 401 states and 589 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-13 22:39:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:30,992 INFO L93 Difference]: Finished difference Result 893 states and 1330 transitions. [2024-10-13 22:39:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:30,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 62 [2024-10-13 22:39:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:30,996 INFO L225 Difference]: With dead ends: 893 [2024-10-13 22:39:30,996 INFO L226 Difference]: Without dead ends: 551 [2024-10-13 22:39:30,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-10-13 22:39:31,000 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 124 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:31,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 312 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-13 22:39:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2024-10-13 22:39:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4817518248175183) internal successors, (812), 548 states have internal predecessors, (812), 0 states have call successors, (0), 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-10-13 22:39:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 812 transitions. [2024-10-13 22:39:31,021 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 812 transitions. Word has length 62 [2024-10-13 22:39:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:31,022 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 812 transitions. [2024-10-13 22:39:31,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-13 22:39:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 812 transitions. [2024-10-13 22:39:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 22:39:31,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:31,027 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:31,035 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:31,228 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-10-13 22:39:31,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:31,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash -411972378, now seen corresponding path program 1 times [2024-10-13 22:39:31,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:31,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056727369] [2024-10-13 22:39:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:31,229 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-10-13 22:39:31,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:31,231 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-10-13 22:39:31,232 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-10-13 22:39:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:31,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:31,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-13 22:39:31,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:31,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:31,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056727369] [2024-10-13 22:39:31,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056727369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:31,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900494535] [2024-10-13 22:39:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:31,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:31,358 INFO L87 Difference]: Start difference. First operand 549 states and 812 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-13 22:39:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:31,383 INFO L93 Difference]: Finished difference Result 553 states and 814 transitions. [2024-10-13 22:39:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 62 [2024-10-13 22:39:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:31,386 INFO L225 Difference]: With dead ends: 553 [2024-10-13 22:39:31,386 INFO L226 Difference]: Without dead ends: 401 [2024-10-13 22:39:31,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-10-13 22:39:31,387 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 122 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:31,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-13 22:39:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2024-10-13 22:39:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.4572864321608041) internal successors, (580), 398 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-10-13 22:39:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 580 transitions. [2024-10-13 22:39:31,399 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 580 transitions. Word has length 62 [2024-10-13 22:39:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:31,399 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 580 transitions. [2024-10-13 22:39:31,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-13 22:39:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 580 transitions. [2024-10-13 22:39:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 22:39:31,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:31,401 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:31,405 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-10-13 22:39:31,603 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-10-13 22:39:31,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -193117660, now seen corresponding path program 1 times [2024-10-13 22:39:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607439943] [2024-10-13 22:39:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:31,605 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-10-13 22:39:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:31,607 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-10-13 22:39:31,608 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-10-13 22:39:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:31,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:39:31,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:39:31,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:39:31,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607439943] [2024-10-13 22:39:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607439943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:31,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:39:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-13 22:39:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69527037] [2024-10-13 22:39:31,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:31,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 22:39:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 22:39:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 22:39:31,953 INFO L87 Difference]: Start difference. First operand 399 states and 580 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-10-13 22:39:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:32,409 INFO L93 Difference]: Finished difference Result 611 states and 918 transitions. [2024-10-13 22:39:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 62 [2024-10-13 22:39:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:32,413 INFO L225 Difference]: With dead ends: 611 [2024-10-13 22:39:32,415 INFO L226 Difference]: Without dead ends: 460 [2024-10-13 22:39:32,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 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-10-13 22:39:32,416 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 385 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:32,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1066 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:39:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-13 22:39:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2024-10-13 22:39:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.421978021978022) internal successors, (647), 455 states have internal predecessors, (647), 0 states have call successors, (0), 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-10-13 22:39:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 647 transitions. [2024-10-13 22:39:32,432 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 647 transitions. Word has length 62 [2024-10-13 22:39:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:32,432 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 647 transitions. [2024-10-13 22:39:32,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-10-13 22:39:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 647 transitions. [2024-10-13 22:39:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 22:39:32,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:32,434 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:32,437 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 22:39:32,634 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-10-13 22:39:32,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:32,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1735736275, now seen corresponding path program 1 times [2024-10-13 22:39:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:32,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966549498] [2024-10-13 22:39:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:32,635 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-10-13 22:39:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:32,637 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-10-13 22:39:32,637 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-10-13 22:39:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:32,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:32,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 22:39:32,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:32,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966549498] [2024-10-13 22:39:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966549498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:32,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:32,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:32,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227004346] [2024-10-13 22:39:32,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:32,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:32,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:32,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:32,722 INFO L87 Difference]: Start difference. First operand 456 states and 647 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-10-13 22:39:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:32,852 INFO L93 Difference]: Finished difference Result 893 states and 1290 transitions. [2024-10-13 22:39:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-13 22:39:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:32,855 INFO L225 Difference]: With dead ends: 893 [2024-10-13 22:39:32,855 INFO L226 Difference]: Without dead ends: 496 [2024-10-13 22:39:32,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:32,856 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:32,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 249 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-13 22:39:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2024-10-13 22:39:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.408080808080808) internal successors, (697), 495 states have internal predecessors, (697), 0 states have call successors, (0), 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-10-13 22:39:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 697 transitions. [2024-10-13 22:39:32,869 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 697 transitions. Word has length 78 [2024-10-13 22:39:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:32,869 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 697 transitions. [2024-10-13 22:39:32,870 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-10-13 22:39:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 697 transitions. [2024-10-13 22:39:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 22:39:32,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:32,871 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:32,875 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-10-13 22:39:33,074 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-10-13 22:39:33,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:33,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1606695298, now seen corresponding path program 1 times [2024-10-13 22:39:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:33,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794717112] [2024-10-13 22:39:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:33,075 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-10-13 22:39:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:33,082 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-10-13 22:39:33,082 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-10-13 22:39:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:33,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:39:33,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 22:39:33,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:39:33,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 22:39:33,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794717112] [2024-10-13 22:39:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794717112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:33,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034482471] [2024-10-13 22:39:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:33,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 22:39:33,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:33,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:33,197 INFO L87 Difference]: Start difference. First operand 496 states and 697 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-10-13 22:39:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:33,247 INFO L93 Difference]: Finished difference Result 1364 states and 1930 transitions. [2024-10-13 22:39:33,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:33,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 96 [2024-10-13 22:39:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:33,252 INFO L225 Difference]: With dead ends: 1364 [2024-10-13 22:39:33,252 INFO L226 Difference]: Without dead ends: 927 [2024-10-13 22:39:33,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-10-13 22:39:33,254 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 120 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:33,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 344 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-10-13 22:39:33,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 925. [2024-10-13 22:39:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.4036796536796536) internal successors, (1297), 924 states have internal predecessors, (1297), 0 states have call successors, (0), 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-10-13 22:39:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1297 transitions. [2024-10-13 22:39:33,280 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1297 transitions. Word has length 96 [2024-10-13 22:39:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:33,280 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1297 transitions. [2024-10-13 22:39:33,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-10-13 22:39:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1297 transitions. [2024-10-13 22:39:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 22:39:33,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:33,285 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:33,289 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-10-13 22:39:33,487 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-10-13 22:39:33,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:33,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash -198743036, now seen corresponding path program 1 times [2024-10-13 22:39:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 22:39:33,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557505887] [2024-10-13 22:39:33,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:33,489 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-10-13 22:39:33,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 22:39:33,490 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-10-13 22:39:33,491 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-10-13 22:39:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:33,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 22:39:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 22:39:33,670 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 22:39:33,671 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 22:39:33,672 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:39:33,679 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-10-13 22:39:33,874 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-10-13 22:39:33,878 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:33,981 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:39:33,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:33 BoogieIcfgContainer [2024-10-13 22:39:33,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:39:33,984 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:39:33,984 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:39:33,985 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:39:33,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:27" (3/4) ... [2024-10-13 22:39:33,986 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 22:39:34,081 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:39:34,081 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:39:34,082 INFO L158 Benchmark]: Toolchain (without parser) took 7923.42ms. Allocated memory was 60.8MB in the beginning and 88.1MB in the end (delta: 27.3MB). Free memory was 41.3MB in the beginning and 31.9MB in the end (delta: 9.4MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,082 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 29.5MB in the beginning and 29.4MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:34,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 24.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.18ms. Allocated memory is still 60.8MB. Free memory was 24.4MB in the beginning and 39.6MB in the end (delta: -15.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,083 INFO L158 Benchmark]: Boogie Preprocessor took 78.09ms. Allocated memory is still 60.8MB. Free memory was 39.6MB in the beginning and 36.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,083 INFO L158 Benchmark]: RCFGBuilder took 787.59ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.5MB in the beginning and 43.3MB in the end (delta: -6.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,083 INFO L158 Benchmark]: TraceAbstraction took 6479.06ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 42.7MB in the beginning and 44.5MB in the end (delta: -1.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,084 INFO L158 Benchmark]: Witness Printer took 96.83ms. Allocated memory is still 88.1MB. Free memory was 44.5MB in the beginning and 31.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:39:34,085 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.16ms. Allocated memory is still 48.2MB. Free memory was 29.5MB in the beginning and 29.4MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.39ms. Allocated memory is still 60.8MB. Free memory was 41.1MB in the beginning and 24.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.18ms. Allocated memory is still 60.8MB. Free memory was 24.4MB in the beginning and 39.6MB in the end (delta: -15.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.09ms. Allocated memory is still 60.8MB. Free memory was 39.6MB in the beginning and 36.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 787.59ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.5MB in the beginning and 43.3MB in the end (delta: -6.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6479.06ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 42.7MB in the beginning and 44.5MB in the end (delta: -1.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 96.83ms. Allocated memory is still 88.1MB. Free memory was 44.5MB in the beginning and 31.9MB 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 [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 [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 [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 [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 [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 [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 [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, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 3913 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2095 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1299 IncrementalHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 1818 mSDtfsCounter, 1299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=925occurred 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.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 682 ConstructedInterpolants, 54 QuantifiedInterpolants, 1830 SizeOfPredicates, 5 NumberOfNonLiveVariables, 851 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 329/428 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-10-13 22:39:34,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE