./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:10,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:10,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:10,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:10,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:10,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:10,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:10,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:10,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:10,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:10,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:10,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:10,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:10,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:10,664 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:10,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:10,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:10,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:10,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:10,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:10,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:10,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:10,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:10,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:10,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:10,672 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:10,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:10,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:10,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:10,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:10,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:10,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:10,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:10,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:10,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:10,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:10,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:10,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:10,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:10,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:10,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:10,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:10,679 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 [2024-11-08 10:22:10,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:10,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:10,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:10,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:10,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:10,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-08 10:22:12,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:12,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:12,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-08 10:22:12,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c53fdd6ab/bb65e8449bce4a42a3e7a98e0a6c2584/FLAG2f238bced [2024-11-08 10:22:12,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c53fdd6ab/bb65e8449bce4a42a3e7a98e0a6c2584 [2024-11-08 10:22:12,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:12,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:12,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:12,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:12,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:12,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:12,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac605d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12, skipping insertion in model container [2024-11-08 10:22:12,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:12,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:12,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-11-08 10:22:12,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:12,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:12,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-11-08 10:22:12,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:12,948 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:12,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12 WrapperNode [2024-11-08 10:22:12,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:12,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:12,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:12,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:12,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:12,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,000 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2024-11-08 10:22:13,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:13,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:13,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:13,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:13,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,029 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:13,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:13,049 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:13,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:13,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:13,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (1/1) ... [2024-11-08 10:22:13,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:13,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:13,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:13,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:13,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:13,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:13,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:13,216 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:13,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:13,233 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 10:22:13,657 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-08 10:22:13,657 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-08 10:22:13,708 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:13,708 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:13,728 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:13,730 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:22:13,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:13 BoogieIcfgContainer [2024-11-08 10:22:13,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:13,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:13,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:13,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:13,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:12" (1/3) ... [2024-11-08 10:22:13,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4660e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:13, skipping insertion in model container [2024-11-08 10:22:13,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:12" (2/3) ... [2024-11-08 10:22:13,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4660e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:13, skipping insertion in model container [2024-11-08 10:22:13,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:13" (3/3) ... [2024-11-08 10:22:13,740 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-11-08 10:22:13,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:13,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:13,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:13,813 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;@3e6195f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:13,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.7196969696969697) internal successors, (227), 133 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:22:13,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:13,824 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, 1, 1] [2024-11-08 10:22:13,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:13,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 260024923, now seen corresponding path program 1 times [2024-11-08 10:22:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026348198] [2024-11-08 10:22:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:14,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:14,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026348198] [2024-11-08 10:22:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026348198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:14,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:14,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046973941] [2024-11-08 10:22:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:14,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:14,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:14,160 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.7196969696969697) internal successors, (227), 133 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:14,327 INFO L93 Difference]: Finished difference Result 263 states and 447 transitions. [2024-11-08 10:22:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 10:22:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:14,340 INFO L225 Difference]: With dead ends: 263 [2024-11-08 10:22:14,340 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 10:22:14,343 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-11-08 10:22:14,347 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:14,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 336 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 10:22:14,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-08 10:22:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.525) internal successors, (183), 120 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2024-11-08 10:22:14,393 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 25 [2024-11-08 10:22:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:14,393 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2024-11-08 10:22:14,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2024-11-08 10:22:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 10:22:14,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:14,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:14,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:22:14,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:14,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash 298727515, now seen corresponding path program 1 times [2024-11-08 10:22:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:14,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770857974] [2024-11-08 10:22:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770857974] [2024-11-08 10:22:14,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770857974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:14,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:14,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:14,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76228597] [2024-11-08 10:22:14,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:14,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:14,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:14,551 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:14,716 INFO L93 Difference]: Finished difference Result 246 states and 376 transitions. [2024-11-08 10:22:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:14,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 10:22:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:14,718 INFO L225 Difference]: With dead ends: 246 [2024-11-08 10:22:14,718 INFO L226 Difference]: Without dead ends: 136 [2024-11-08 10:22:14,718 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-11-08 10:22:14,720 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:14,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 258 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-08 10:22:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-08 10:22:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5037037037037038) internal successors, (203), 135 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2024-11-08 10:22:14,732 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 37 [2024-11-08 10:22:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:14,733 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2024-11-08 10:22:14,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2024-11-08 10:22:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:22:14,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:14,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:14,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:22:14,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1202041694, now seen corresponding path program 1 times [2024-11-08 10:22:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943060811] [2024-11-08 10:22:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:22:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943060811] [2024-11-08 10:22:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943060811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:14,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:14,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637187886] [2024-11-08 10:22:14,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:14,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:14,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:14,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:14,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:14,845 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:14,877 INFO L93 Difference]: Finished difference Result 287 states and 424 transitions. [2024-11-08 10:22:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:14,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-08 10:22:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:14,879 INFO L225 Difference]: With dead ends: 287 [2024-11-08 10:22:14,879 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 10:22:14,879 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-11-08 10:22:14,880 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:14,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 335 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 10:22:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-08 10:22:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2024-11-08 10:22:14,894 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 51 [2024-11-08 10:22:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:14,894 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2024-11-08 10:22:14,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2024-11-08 10:22:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:22:14,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:14,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:14,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:22:14,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:14,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1068028188, now seen corresponding path program 1 times [2024-11-08 10:22:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827234079] [2024-11-08 10:22:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:22:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827234079] [2024-11-08 10:22:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827234079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052851053] [2024-11-08 10:22:14,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:14,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:14,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:14,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:14,995 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:15,132 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2024-11-08 10:22:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:15,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-08 10:22:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:15,134 INFO L225 Difference]: With dead ends: 304 [2024-11-08 10:22:15,134 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 10:22:15,135 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-11-08 10:22:15,136 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:15,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 10:22:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-08 10:22:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.449438202247191) internal successors, (258), 178 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 258 transitions. [2024-11-08 10:22:15,154 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 258 transitions. Word has length 51 [2024-11-08 10:22:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 258 transitions. [2024-11-08 10:22:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 258 transitions. [2024-11-08 10:22:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 10:22:15,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:15,159 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:15,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:22:15,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash 116906692, now seen corresponding path program 1 times [2024-11-08 10:22:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580787100] [2024-11-08 10:22:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:15,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580787100] [2024-11-08 10:22:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580787100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:15,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:15,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123877216] [2024-11-08 10:22:15,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:15,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:15,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:15,231 INFO L87 Difference]: Start difference. First operand 179 states and 258 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:15,255 INFO L93 Difference]: Finished difference Result 483 states and 698 transitions. [2024-11-08 10:22:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-08 10:22:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:15,257 INFO L225 Difference]: With dead ends: 483 [2024-11-08 10:22:15,257 INFO L226 Difference]: Without dead ends: 341 [2024-11-08 10:22:15,258 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-11-08 10:22:15,259 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 130 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:15,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 341 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-08 10:22:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2024-11-08 10:22:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4349112426035502) internal successors, (485), 338 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 485 transitions. [2024-11-08 10:22:15,272 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 485 transitions. Word has length 70 [2024-11-08 10:22:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:15,273 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 485 transitions. [2024-11-08 10:22:15,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 485 transitions. [2024-11-08 10:22:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 10:22:15,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:15,279 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:15,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:22:15,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:15,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash 723779029, now seen corresponding path program 1 times [2024-11-08 10:22:15,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:15,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051751781] [2024-11-08 10:22:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:15,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:15,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051751781] [2024-11-08 10:22:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051751781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066464664] [2024-11-08 10:22:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:15,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:15,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:22:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:15,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:22:15,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:15,696 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:15,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066464664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:15,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-08 10:22:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859086990] [2024-11-08 10:22:15,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:15,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:22:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:22:15,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:15,819 INFO L87 Difference]: Start difference. First operand 339 states and 485 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:16,336 INFO L93 Difference]: Finished difference Result 1000 states and 1551 transitions. [2024-11-08 10:22:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-08 10:22:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:16,340 INFO L225 Difference]: With dead ends: 1000 [2024-11-08 10:22:16,341 INFO L226 Difference]: Without dead ends: 599 [2024-11-08 10:22:16,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:22:16,345 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 284 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:16,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 958 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:22:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-08 10:22:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 591. [2024-11-08 10:22:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4254237288135594) internal successors, (841), 590 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 841 transitions. [2024-11-08 10:22:16,394 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 841 transitions. Word has length 70 [2024-11-08 10:22:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 841 transitions. [2024-11-08 10:22:16,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 841 transitions. [2024-11-08 10:22:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 10:22:16,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:16,397 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:16,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:22:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 10:22:16,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:16,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1569273146, now seen corresponding path program 1 times [2024-11-08 10:22:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531126552] [2024-11-08 10:22:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:16,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531126552] [2024-11-08 10:22:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531126552] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054736854] [2024-11-08 10:22:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:16,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:16,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:16,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:22:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:16,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:22:16,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:16,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054736854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:17,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:17,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-08 10:22:17,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761371895] [2024-11-08 10:22:17,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 10:22:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 10:22:17,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:22:17,060 INFO L87 Difference]: Start difference. First operand 591 states and 841 transitions. Second operand has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,478 INFO L93 Difference]: Finished difference Result 1341 states and 1933 transitions. [2024-11-08 10:22:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:22:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-08 10:22:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,482 INFO L225 Difference]: With dead ends: 1341 [2024-11-08 10:22:17,482 INFO L226 Difference]: Without dead ends: 773 [2024-11-08 10:22:17,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:22:17,486 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 270 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1197 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:22:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-11-08 10:22:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 591. [2024-11-08 10:22:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4220338983050846) internal successors, (839), 590 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 839 transitions. [2024-11-08 10:22:17,506 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 839 transitions. Word has length 70 [2024-11-08 10:22:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,506 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 839 transitions. [2024-11-08 10:22:17,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 839 transitions. [2024-11-08 10:22:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 10:22:17,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,508 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:22:17,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 10:22:17,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash -962400809, now seen corresponding path program 1 times [2024-11-08 10:22:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584259720] [2024-11-08 10:22:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:17,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584259720] [2024-11-08 10:22:17,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584259720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030046328] [2024-11-08 10:22:17,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,788 INFO L87 Difference]: Start difference. First operand 591 states and 839 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,833 INFO L93 Difference]: Finished difference Result 774 states and 1096 transitions. [2024-11-08 10:22:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-08 10:22:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,835 INFO L225 Difference]: With dead ends: 774 [2024-11-08 10:22:17,835 INFO L226 Difference]: Without dead ends: 417 [2024-11-08 10:22:17,836 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-11-08 10:22:17,836 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 124 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 482 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-08 10:22:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2024-11-08 10:22:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4077669902912622) internal successors, (580), 412 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 580 transitions. [2024-11-08 10:22:17,849 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 580 transitions. Word has length 70 [2024-11-08 10:22:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,851 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 580 transitions. [2024-11-08 10:22:17,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 580 transitions. [2024-11-08 10:22:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 10:22:17,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,852 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:22:17,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1736122508, now seen corresponding path program 1 times [2024-11-08 10:22:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020256127] [2024-11-08 10:22:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020256127] [2024-11-08 10:22:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020256127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450383160] [2024-11-08 10:22:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:17,929 INFO L87 Difference]: Start difference. First operand 413 states and 580 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:17,942 INFO L93 Difference]: Finished difference Result 593 states and 834 transitions. [2024-11-08 10:22:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-08 10:22:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:17,944 INFO L225 Difference]: With dead ends: 593 [2024-11-08 10:22:17,944 INFO L226 Difference]: Without dead ends: 415 [2024-11-08 10:22:17,945 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-11-08 10:22:17,946 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 125 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:17,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 331 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-08 10:22:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2024-11-08 10:22:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4053398058252426) internal successors, (579), 412 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 579 transitions. [2024-11-08 10:22:17,958 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 579 transitions. Word has length 71 [2024-11-08 10:22:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:17,958 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 579 transitions. [2024-11-08 10:22:17,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 579 transitions. [2024-11-08 10:22:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-08 10:22:17,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:17,960 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:17,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:22:17,960 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:17,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash -884679086, now seen corresponding path program 1 times [2024-11-08 10:22:17,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193125987] [2024-11-08 10:22:17,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:17,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:22:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:18,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 10:22:18,033 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:22:18,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:18,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:22:18,039 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:18,136 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:18,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:18 BoogieIcfgContainer [2024-11-08 10:22:18,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:18,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:18,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:18,139 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:18,140 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:13" (3/4) ... [2024-11-08 10:22:18,143 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 10:22:18,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:18,145 INFO L158 Benchmark]: Toolchain (without parser) took 5562.45ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 159.4MB in the beginning and 138.6MB in the end (delta: 20.8MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:18,145 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:18,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.06ms. Allocated memory is still 188.7MB. Free memory was 159.2MB in the beginning and 145.2MB in the end (delta: 14.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:18,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.24ms. Allocated memory is still 188.7MB. Free memory was 145.2MB in the beginning and 142.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:18,146 INFO L158 Benchmark]: Boogie Preprocessor took 46.71ms. Allocated memory is still 188.7MB. Free memory was 142.3MB in the beginning and 138.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:18,146 INFO L158 Benchmark]: RCFGBuilder took 681.42ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 102.0MB in the end (delta: 36.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-08 10:22:18,147 INFO L158 Benchmark]: TraceAbstraction took 4406.21ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 101.2MB in the beginning and 138.6MB in the end (delta: -37.4MB). Peak memory consumption was 95.1kB. Max. memory is 16.1GB. [2024-11-08 10:22:18,147 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 226.5MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:18,148 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 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.06ms. Allocated memory is still 188.7MB. Free memory was 159.2MB in the beginning and 145.2MB in the end (delta: 14.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.24ms. Allocated memory is still 188.7MB. Free memory was 145.2MB in the beginning and 142.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.71ms. Allocated memory is still 188.7MB. Free memory was 142.3MB in the beginning and 138.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 681.42ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 102.0MB in the end (delta: 36.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4406.21ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 101.2MB in the beginning and 138.6MB in the end (delta: -37.4MB). Peak memory consumption was 95.1kB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 226.5MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 624]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 311. Possible FailurePath: [L633] int __retres1 ; [L637] CALL ssl3_connect() [L19] int s__info_callback = __VERIFIER_nondet_int(); [L20] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L21] int s__state ; [L22] int s__new_session ; [L23] int s__server ; [L24] unsigned int s__version = __VERIFIER_nondet_uint(); [L25] int s__type ; [L26] int s__init_num ; [L27] int s__bbio = __VERIFIER_nondet_int(); [L28] int s__wbio = __VERIFIER_nondet_int(); [L29] int s__hit = __VERIFIER_nondet_int(); [L30] int s__rwstate ; [L31] int s__init_buf___0 = __VERIFIER_nondet_int(); [L32] int s__debug = __VERIFIER_nondet_int(); [L33] int s__shutdown ; [L34] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L35] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L36] unsigned int s__ctx__stats__sess_connect = __VERIFIER_nondet_uint(); [L37] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L38] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L39] int s__s3__change_cipher_spec ; [L40] int s__s3__flags = __VERIFIER_nondet_int(); [L41] int s__s3__delay_buf_pop_ret ; [L42] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L43] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L44] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L45] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L46] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L47] int s__s3__tmp__next_state___0 ; [L48] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L49] int s__session__cipher ; [L50] int s__session__compress_meth ; [L51] int buf ; [L52] unsigned long tmp ; [L53] unsigned long l ; [L54] int num1 = __VERIFIER_nondet_int(); [L55] int cb ; [L56] int ret ; [L57] int new_state ; [L58] int state ; [L59] int skip ; [L60] int tmp___0 ; [L61] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L62] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L63] int tmp___3 = __VERIFIER_nondet_int(); [L64] int tmp___4 = __VERIFIER_nondet_int(); [L65] int tmp___5 = __VERIFIER_nondet_int(); [L66] int tmp___6 = __VERIFIER_nondet_int(); [L67] int tmp___7 = __VERIFIER_nondet_int(); [L68] int tmp___8 = __VERIFIER_nondet_int(); [L69] int tmp___9 = __VERIFIER_nondet_int(); [L70] int blastFlag ; [L71] int ag_X ; [L72] int ag_Y ; [L73] int ag_Z ; [L74] int __retres60 ; [L77] s__state = 12292 [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 VAL [blastFlag=0, cb=0, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__info_callback=1, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L93] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L94] COND FALSE !(tmp___1 + 12288) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE \read(s__hit) [L104] ag_Y = 208 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND TRUE s__state == 12292 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L215] s__new_session = 1 [L216] s__state = 4096 [L217] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L222] s__server = 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L223] COND TRUE cb != 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L235] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L253] COND FALSE !(! tmp___4) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L259] COND FALSE !(! tmp___5) [L265] s__state = 4368 [L266] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L267] s__init_num = 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4368 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L278] COND FALSE !(ret <= 0) [L283] s__state = 4384 [L284] ag_X = s__state - 32 [L285] s__init_num = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L310] COND TRUE \read(s__hit) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L311] EXPR s__state | ag_Y VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L311] s__state = s__state | ag_Y [L315] s__init_num = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L111] state = s__state VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Y=208, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L624] reach_error() VAL [ag_X=4352, ag_Y=208, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 980 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 980 mSDsluCounter, 4509 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2655 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1455 IncrementalHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 1854 mSDtfsCounter, 1455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 198 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 1910 SizeOfPredicates, 2 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 254/404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 10:22:18,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:20,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:20,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 10:22:20,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:20,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:20,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:20,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:20,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:20,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:20,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:20,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:20,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:20,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:20,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:20,435 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:20,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:20,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:20,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:20,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:20,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:20,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:20,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:20,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:20,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 10:22:20,440 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 10:22:20,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:20,441 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 10:22:20,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:20,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:20,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:20,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:20,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:20,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:20,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:20,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:20,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:20,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:20,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:20,445 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 10:22:20,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 10:22:20,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:20,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:20,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:20,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:20,446 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 [2024-11-08 10:22:20,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:20,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:20,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:20,791 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:20,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:20,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-08 10:22:22,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:22,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:22,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-08 10:22:22,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ddd6896/d0e3d44eca2a407cb78a8106ba67b984/FLAGc45975c7a [2024-11-08 10:22:22,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ddd6896/d0e3d44eca2a407cb78a8106ba67b984 [2024-11-08 10:22:22,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:22,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:22,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:22,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:22,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:22,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:22" (1/1) ... [2024-11-08 10:22:22,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6914139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:22, skipping insertion in model container [2024-11-08 10:22:22,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:22" (1/1) ... [2024-11-08 10:22:22,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:23,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-11-08 10:22:23,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:23,270 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:23,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-11-08 10:22:23,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:23,357 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:23,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23 WrapperNode [2024-11-08 10:22:23,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:23,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:23,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:23,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:23,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,421 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-11-08 10:22:23,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:23,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:23,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:23,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:23,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:23,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:23,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:23,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:23,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:23,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (1/1) ... [2024-11-08 10:22:23,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:23,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:23,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:23,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 10:22:23,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:23,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:23,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:23,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:23,700 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 10:22:24,190 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-08 10:22:24,190 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-08 10:22:24,245 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:24,246 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:24,260 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:24,260 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:22:24,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:24 BoogieIcfgContainer [2024-11-08 10:22:24,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:24,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:24,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:24,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:24,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:22" (1/3) ... [2024-11-08 10:22:24,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194b5393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:24, skipping insertion in model container [2024-11-08 10:22:24,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:23" (2/3) ... [2024-11-08 10:22:24,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194b5393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:24, skipping insertion in model container [2024-11-08 10:22:24,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:24" (3/3) ... [2024-11-08 10:22:24,274 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-11-08 10:22:24,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:24,303 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:24,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:24,366 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;@33f45f71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:24,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 10:22:24,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:24,377 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, 1, 1] [2024-11-08 10:22:24,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:24,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 259999105, now seen corresponding path program 1 times [2024-11-08 10:22:24,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:24,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877005963] [2024-11-08 10:22:24,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:24,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:24,400 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:24,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 10:22:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:24,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:24,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:24,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:24,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:24,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877005963] [2024-11-08 10:22:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877005963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:24,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:24,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002875776] [2024-11-08 10:22:24,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:24,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:24,614 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:24,813 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2024-11-08 10:22:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-08 10:22:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:24,825 INFO L225 Difference]: With dead ends: 247 [2024-11-08 10:22:24,826 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 10:22:24,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:24,832 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:24,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 10:22:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-08 10:22:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-11-08 10:22:24,867 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2024-11-08 10:22:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-11-08 10:22:24,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-11-08 10:22:24,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 10:22:24,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:24,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:24,872 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 (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:25,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:25,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:25,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1138040513, now seen corresponding path program 1 times [2024-11-08 10:22:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415029285] [2024-11-08 10:22:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:25,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:25,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:25,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:25,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 10:22:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:25,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:25,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:25,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:25,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415029285] [2024-11-08 10:22:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415029285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:25,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:25,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854191233] [2024-11-08 10:22:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:25,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:25,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:25,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:25,165 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:25,311 INFO L93 Difference]: Finished difference Result 230 states and 352 transitions. [2024-11-08 10:22:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:25,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 10:22:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:25,313 INFO L225 Difference]: With dead ends: 230 [2024-11-08 10:22:25,314 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 10:22:25,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:25,317 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:25,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 10:22:25,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-08 10:22:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-11-08 10:22:25,332 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 37 [2024-11-08 10:22:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:25,333 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-11-08 10:22:25,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-11-08 10:22:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:22:25,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:25,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:25,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 10:22:25,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:25,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:25,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1126420040, now seen corresponding path program 1 times [2024-11-08 10:22:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460873883] [2024-11-08 10:22:25,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:25,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:25,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:25,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:25,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 10:22:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:25,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:25,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:22:25,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:25,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460873883] [2024-11-08 10:22:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460873883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171466932] [2024-11-08 10:22:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:25,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:25,670 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:25,693 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2024-11-08 10:22:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:25,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-08 10:22:25,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:25,695 INFO L225 Difference]: With dead ends: 271 [2024-11-08 10:22:25,697 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 10:22:25,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:25,701 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:25,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 10:22:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-08 10:22:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-08 10:22:25,718 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 51 [2024-11-08 10:22:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:25,718 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-08 10:22:25,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-08 10:22:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:22:25,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:25,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:25,729 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-11-08 10:22:25,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:25,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1260433546, now seen corresponding path program 1 times [2024-11-08 10:22:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967921429] [2024-11-08 10:22:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:25,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:25,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:25,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:25,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 10:22:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:25,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:25,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:22:26,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:26,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:26,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967921429] [2024-11-08 10:22:26,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967921429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:26,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:26,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:26,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064662674] [2024-11-08 10:22:26,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:26,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:26,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:26,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:26,040 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:26,164 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2024-11-08 10:22:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-08 10:22:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:26,165 INFO L225 Difference]: With dead ends: 288 [2024-11-08 10:22:26,166 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 10:22:26,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:26,167 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:26,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 10:22:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-08 10:22:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 170 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2024-11-08 10:22:26,176 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 51 [2024-11-08 10:22:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2024-11-08 10:22:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2024-11-08 10:22:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 10:22:26,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:26,179 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:26,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 10:22:26,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:26,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -457628469, now seen corresponding path program 1 times [2024-11-08 10:22:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391480775] [2024-11-08 10:22:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:26,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:26,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:26,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 10:22:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:26,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:22:26,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:26,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:26,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391480775] [2024-11-08 10:22:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391480775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:26,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:26,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 10:22:26,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313648097] [2024-11-08 10:22:26,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:26,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:26,878 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:27,347 INFO L93 Difference]: Finished difference Result 556 states and 838 transitions. [2024-11-08 10:22:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-08 10:22:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:27,352 INFO L225 Difference]: With dead ends: 556 [2024-11-08 10:22:27,353 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 10:22:27,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:27,354 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 444 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:27,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 378 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:22:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 10:22:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2024-11-08 10:22:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4521531100478469) internal successors, (607), 418 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 607 transitions. [2024-11-08 10:22:27,410 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 607 transitions. Word has length 68 [2024-11-08 10:22:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:27,411 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 607 transitions. [2024-11-08 10:22:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 607 transitions. [2024-11-08 10:22:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 10:22:27,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:27,417 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:27,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 10:22:27,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:27,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2031900493, now seen corresponding path program 1 times [2024-11-08 10:22:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178677352] [2024-11-08 10:22:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:27,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:27,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:27,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:27,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 10:22:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:27,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:27,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:27,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:27,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:27,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178677352] [2024-11-08 10:22:27,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178677352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:27,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534374943] [2024-11-08 10:22:27,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:27,765 INFO L87 Difference]: Start difference. First operand 419 states and 607 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:27,788 INFO L93 Difference]: Finished difference Result 927 states and 1364 transitions. [2024-11-08 10:22:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-08 10:22:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:27,791 INFO L225 Difference]: With dead ends: 927 [2024-11-08 10:22:27,791 INFO L226 Difference]: Without dead ends: 574 [2024-11-08 10:22:27,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:27,795 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:27,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-08 10:22:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-11-08 10:22:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4623467600700526) internal successors, (835), 571 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 835 transitions. [2024-11-08 10:22:27,812 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 835 transitions. Word has length 68 [2024-11-08 10:22:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:27,812 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 835 transitions. [2024-11-08 10:22:27,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 835 transitions. [2024-11-08 10:22:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 10:22:27,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:27,814 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:27,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 10:22:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:28,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:28,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash -875025075, now seen corresponding path program 1 times [2024-11-08 10:22:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:28,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585482889] [2024-11-08 10:22:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:28,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:28,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:28,020 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:28,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 10:22:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:28,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:28,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:28,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:28,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585482889] [2024-11-08 10:22:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585482889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115940777] [2024-11-08 10:22:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:28,162 INFO L87 Difference]: Start difference. First operand 572 states and 835 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:28,183 INFO L93 Difference]: Finished difference Result 576 states and 837 transitions. [2024-11-08 10:22:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:28,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-08 10:22:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:28,187 INFO L225 Difference]: With dead ends: 576 [2024-11-08 10:22:28,187 INFO L226 Difference]: Without dead ends: 419 [2024-11-08 10:22:28,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:28,188 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:28,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 399 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-08 10:22:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-08 10:22:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.4375) internal successors, (598), 416 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 598 transitions. [2024-11-08 10:22:28,201 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 598 transitions. Word has length 68 [2024-11-08 10:22:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:28,202 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 598 transitions. [2024-11-08 10:22:28,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 598 transitions. [2024-11-08 10:22:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 10:22:28,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:28,204 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:28,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-08 10:22:28,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:28,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1614503887, now seen corresponding path program 1 times [2024-11-08 10:22:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446337324] [2024-11-08 10:22:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:28,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:28,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:28,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:28,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 10:22:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:28,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:22:28,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:22:28,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 10:22:28,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:28,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446337324] [2024-11-08 10:22:28,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446337324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:28,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:28,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 10:22:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485012862] [2024-11-08 10:22:28,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:22:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:28,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:22:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:22:28,820 INFO L87 Difference]: Start difference. First operand 417 states and 598 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:29,309 INFO L93 Difference]: Finished difference Result 636 states and 943 transitions. [2024-11-08 10:22:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-08 10:22:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:29,313 INFO L225 Difference]: With dead ends: 636 [2024-11-08 10:22:29,313 INFO L226 Difference]: Without dead ends: 480 [2024-11-08 10:22:29,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:22:29,315 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 255 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:29,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1236 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:22:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-08 10:22:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2024-11-08 10:22:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 667 transitions. [2024-11-08 10:22:29,328 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 667 transitions. Word has length 68 [2024-11-08 10:22:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:29,328 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 667 transitions. [2024-11-08 10:22:29,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 667 transitions. [2024-11-08 10:22:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 10:22:29,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:29,330 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:29,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 10:22:29,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:29,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:29,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:29,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1844660206, now seen corresponding path program 1 times [2024-11-08 10:22:29,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582266338] [2024-11-08 10:22:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:29,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:29,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:29,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 10:22:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:29,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:29,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-08 10:22:29,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:29,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582266338] [2024-11-08 10:22:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582266338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439363003] [2024-11-08 10:22:29,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:29,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:29,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:29,623 INFO L87 Difference]: Start difference. First operand 476 states and 667 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:29,748 INFO L93 Difference]: Finished difference Result 928 states and 1325 transitions. [2024-11-08 10:22:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-08 10:22:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:29,750 INFO L225 Difference]: With dead ends: 928 [2024-11-08 10:22:29,750 INFO L226 Difference]: Without dead ends: 518 [2024-11-08 10:22:29,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:29,752 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:29,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 259 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-08 10:22:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2024-11-08 10:22:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.390715667311412) internal successors, (719), 517 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 719 transitions. [2024-11-08 10:22:29,764 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 719 transitions. Word has length 85 [2024-11-08 10:22:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:29,764 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 719 transitions. [2024-11-08 10:22:29,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 719 transitions. [2024-11-08 10:22:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 10:22:29,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:29,766 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:29,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 10:22:29,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:29,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:29,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2022672797, now seen corresponding path program 1 times [2024-11-08 10:22:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:29,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154771949] [2024-11-08 10:22:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:29,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:29,969 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:29,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 10:22:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:30,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:30,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 10:22:30,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:30,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:22:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154771949] [2024-11-08 10:22:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154771949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398797475] [2024-11-08 10:22:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:22:30,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:30,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:30,123 INFO L87 Difference]: Start difference. First operand 518 states and 719 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:30,173 INFO L93 Difference]: Finished difference Result 1416 states and 1982 transitions. [2024-11-08 10:22:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:30,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-08 10:22:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:30,178 INFO L225 Difference]: With dead ends: 1416 [2024-11-08 10:22:30,178 INFO L226 Difference]: Without dead ends: 964 [2024-11-08 10:22:30,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:30,180 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 121 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:30,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 359 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-08 10:22:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2024-11-08 10:22:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3881373569198752) internal successors, (1334), 961 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1334 transitions. [2024-11-08 10:22:30,205 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1334 transitions. Word has length 104 [2024-11-08 10:22:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1334 transitions. [2024-11-08 10:22:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1334 transitions. [2024-11-08 10:22:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 10:22:30,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:30,210 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:30,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:30,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:30,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:30,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:30,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1888659291, now seen corresponding path program 1 times [2024-11-08 10:22:30,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:22:30,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038599488] [2024-11-08 10:22:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:22:30,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:22:30,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-08 10:22:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:30,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:22:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:30,580 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-08 10:22:30,581 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:22:30,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:30,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-08 10:22:30,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:22:30,787 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:30,888 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:30,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:30 BoogieIcfgContainer [2024-11-08 10:22:30,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:30,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:30,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:30,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:30,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:24" (3/4) ... [2024-11-08 10:22:30,893 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 10:22:31,003 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:22:31,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:31,003 INFO L158 Benchmark]: Toolchain (without parser) took 8090.97ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 31.7MB in the beginning and 84.2MB in the end (delta: -52.5MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,004 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 50.3MB. Free memory is still 23.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:31,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.59ms. Allocated memory is still 65.0MB. Free memory was 31.5MB in the beginning and 29.3MB in the end (delta: 2.1MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.70ms. Allocated memory is still 65.0MB. Free memory was 29.3MB in the beginning and 42.8MB in the end (delta: -13.4MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,004 INFO L158 Benchmark]: Boogie Preprocessor took 83.49ms. Allocated memory is still 65.0MB. Free memory was 42.8MB in the beginning and 39.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,005 INFO L158 Benchmark]: RCFGBuilder took 754.67ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 39.6MB in the beginning and 34.0MB in the end (delta: 5.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,005 INFO L158 Benchmark]: TraceAbstraction took 6626.42ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 33.6MB in the beginning and 34.4MB in the end (delta: -788.0kB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,008 INFO L158 Benchmark]: Witness Printer took 111.60ms. Allocated memory is still 117.4MB. Free memory was 34.4MB in the beginning and 84.2MB in the end (delta: -49.8MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-08 10:22:31,010 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.93ms. Allocated memory is still 50.3MB. Free memory is still 23.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.59ms. Allocated memory is still 65.0MB. Free memory was 31.5MB in the beginning and 29.3MB in the end (delta: 2.1MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.70ms. Allocated memory is still 65.0MB. Free memory was 29.3MB in the beginning and 42.8MB in the end (delta: -13.4MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.49ms. Allocated memory is still 65.0MB. Free memory was 42.8MB in the beginning and 39.6MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 754.67ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 39.6MB in the beginning and 34.0MB in the end (delta: 5.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6626.42ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 33.6MB in the beginning and 34.4MB in the end (delta: -788.0kB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 111.60ms. Allocated memory is still 117.4MB. Free memory was 34.4MB in the beginning and 84.2MB in the end (delta: -49.8MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 624]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L633] int __retres1 ; [L637] CALL ssl3_connect() [L19] int s__info_callback = __VERIFIER_nondet_int(); [L20] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L21] int s__state ; [L22] int s__new_session ; [L23] int s__server ; [L24] unsigned int s__version = __VERIFIER_nondet_uint(); [L25] int s__type ; [L26] int s__init_num ; [L27] int s__bbio = __VERIFIER_nondet_int(); [L28] int s__wbio = __VERIFIER_nondet_int(); [L29] int s__hit = __VERIFIER_nondet_int(); [L30] int s__rwstate ; [L31] int s__init_buf___0 = __VERIFIER_nondet_int(); [L32] int s__debug = __VERIFIER_nondet_int(); [L33] int s__shutdown ; [L34] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L35] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L36] unsigned int s__ctx__stats__sess_connect = __VERIFIER_nondet_uint(); [L37] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L38] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L39] int s__s3__change_cipher_spec ; [L40] int s__s3__flags = __VERIFIER_nondet_int(); [L41] int s__s3__delay_buf_pop_ret ; [L42] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L43] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L44] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L45] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L46] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L47] int s__s3__tmp__next_state___0 ; [L48] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L49] int s__session__cipher ; [L50] int s__session__compress_meth ; [L51] int buf ; [L52] unsigned long tmp ; [L53] unsigned long l ; [L54] int num1 = __VERIFIER_nondet_int(); [L55] int cb ; [L56] int ret ; [L57] int new_state ; [L58] int state ; [L59] int skip ; [L60] int tmp___0 ; [L61] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L62] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L63] int tmp___3 = __VERIFIER_nondet_int(); [L64] int tmp___4 = __VERIFIER_nondet_int(); [L65] int tmp___5 = __VERIFIER_nondet_int(); [L66] int tmp___6 = __VERIFIER_nondet_int(); [L67] int tmp___7 = __VERIFIER_nondet_int(); [L68] int tmp___8 = __VERIFIER_nondet_int(); [L69] int tmp___9 = __VERIFIER_nondet_int(); [L70] int blastFlag ; [L71] int ag_X ; [L72] int ag_Y ; [L73] int ag_Z ; [L74] int __retres60 ; [L77] s__state = 12292 [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 VAL [blastFlag=0, cb=0, ret=-1, s__state=12292, skip=0] [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback VAL [blastFlag=0, cb=2, ret=-1, s__state=12292, skip=0] [L93] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=2, ret=-1, s__in_handshake=0, s__state=12292, skip=0] [L94] COND FALSE !(tmp___1 + 12288) VAL [blastFlag=0, cb=2, ret=-1, s__in_handshake=0, s__state=12292, skip=0] [L103] COND FALSE !(\read(s__hit)) [L106] ag_Z = 48 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0] [L109] COND TRUE 1 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0] [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0, state=12292] [L112] COND TRUE s__state == 12292 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L215] s__new_session = 1 [L216] s__state = 4096 [L217] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L222] s__server = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L223] COND TRUE cb != 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__version=-64512, skip=0, state=12292] [L235] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__version=-64512, skip=0, state=12292] [L253] COND FALSE !(! tmp___4) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__version=-64512, skip=0, state=12292, tmp___4=2] [L259] COND FALSE !(! tmp___5) [L265] s__state = 4368 [L266] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L267] s__init_num = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L127] COND TRUE s__state == 4368 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Z=48, blastFlag=1, cb=2, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L278] COND FALSE !(ret <= 0) [L283] s__state = 4384 [L284] ag_X = s__state - 32 [L285] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4352, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L310] COND FALSE !(\read(s__hit)) [L313] s__state = s__state | ag_Z VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L315] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L139] COND TRUE s__state == 4400 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L319] COND TRUE (unsigned long )s__s3__tmp__new_cipher__algorithms + 256UL [L320] skip = 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L334] s__state = 4416 [L335] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L145] COND TRUE s__state == 4416 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L339] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L340] COND FALSE !(blastFlag == 3) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L345] COND FALSE !(ret <= 0) [L350] s__state = 4432 [L351] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L352] COND FALSE !(! tmp___6) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L109] COND TRUE 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Z=48, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L624] reach_error() VAL [ag_X=4352, ag_Z=48, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1122 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1122 mSDsluCounter, 4082 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2180 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1299 IncrementalHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 1902 mSDtfsCounter, 1299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=962occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 749 ConstructedInterpolants, 59 QuantifiedInterpolants, 2007 SizeOfPredicates, 5 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 383/496 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 10:22:31,043 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