./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:34,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:34,907 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:03:34,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:34,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:34,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:34,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:34,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:34,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:34,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:34,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:34,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:34,950 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:34,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:34,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:03:34,952 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:34,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:34,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:34,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:34,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:03:34,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:34,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:03:34,957 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:34,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:03:34,958 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:34,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:34,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:34,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:34,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:34,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:34,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:34,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:03:34,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:34,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:34,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:34,965 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:03:34,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:34,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:34,966 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:34,967 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2023-11-06 23:03:35,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:35,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:35,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:35,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:35,336 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:35,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2023-11-06 23:03:38,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:38,760 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:38,761 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2023-11-06 23:03:38,775 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/data/a2042d44b/abf17a2da1b544c6a443ea445e0fcb18/FLAG12d283eb8 [2023-11-06 23:03:38,788 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/data/a2042d44b/abf17a2da1b544c6a443ea445e0fcb18 [2023-11-06 23:03:38,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:38,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:38,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:38,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:38,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:38,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:38" (1/1) ... [2023-11-06 23:03:38,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cc5601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:38, skipping insertion in model container [2023-11-06 23:03:38,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:38" (1/1) ... [2023-11-06 23:03:38,853 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:39,103 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2023-11-06 23:03:39,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:39,144 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:39,243 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2023-11-06 23:03:39,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:39,286 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:39,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39 WrapperNode [2023-11-06 23:03:39,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:39,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:39,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:39,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:39,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,373 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2023-11-06 23:03:39,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:39,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:39,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:39,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:39,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:39,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:39,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:39,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:39,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:39,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:39,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:39,668 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:39,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:39,694 WARN L818 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-06 23:03:40,489 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2023-11-06 23:03:40,489 INFO L771 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2023-11-06 23:03:40,489 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:40,499 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:40,500 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 23:03:40,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:40 BoogieIcfgContainer [2023-11-06 23:03:40,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:40,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:40,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:40,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:40,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:38" (1/3) ... [2023-11-06 23:03:40,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5072d69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:40, skipping insertion in model container [2023-11-06 23:03:40,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39" (2/3) ... [2023-11-06 23:03:40,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5072d69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:40, skipping insertion in model container [2023-11-06 23:03:40,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:40" (3/3) ... [2023-11-06 23:03:40,528 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2023-11-06 23:03:40,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:40,552 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:03:40,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:40,660 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4eb8b06d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:40,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:03:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 23:03:40,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:40,692 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:40,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:40,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2093125050, now seen corresponding path program 1 times [2023-11-06 23:03:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352639376] [2023-11-06 23:03:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352639376] [2023-11-06 23:03:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352639376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816702170] [2023-11-06 23:03:41,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:41,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:41,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:41,412 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 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 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:41,693 INFO L93 Difference]: Finished difference Result 361 states and 635 transitions. [2023-11-06 23:03:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:41,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-11-06 23:03:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:41,715 INFO L225 Difference]: With dead ends: 361 [2023-11-06 23:03:41,715 INFO L226 Difference]: Without dead ends: 194 [2023-11-06 23:03:41,719 INFO L412 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 [2023-11-06 23:03:41,723 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 205 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:41,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 231 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-06 23:03:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2023-11-06 23:03:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.679144385026738) internal successors, (314), 187 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 314 transitions. [2023-11-06 23:03:41,814 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 314 transitions. Word has length 45 [2023-11-06 23:03:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:41,817 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 314 transitions. [2023-11-06 23:03:41,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 314 transitions. [2023-11-06 23:03:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:03:41,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:41,827 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:41,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:03:41,828 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:41,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 452769504, now seen corresponding path program 1 times [2023-11-06 23:03:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714797247] [2023-11-06 23:03:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:42,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714797247] [2023-11-06 23:03:42,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714797247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714093247] [2023-11-06 23:03:42,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:42,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:42,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:42,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:42,079 INFO L87 Difference]: Start difference. First operand 188 states and 314 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:42,342 INFO L93 Difference]: Finished difference Result 413 states and 696 transitions. [2023-11-06 23:03:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:42,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-06 23:03:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:42,346 INFO L225 Difference]: With dead ends: 413 [2023-11-06 23:03:42,346 INFO L226 Difference]: Without dead ends: 235 [2023-11-06 23:03:42,348 INFO L412 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 [2023-11-06 23:03:42,349 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 167 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:42,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 183 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-06 23:03:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 229. [2023-11-06 23:03:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.7149122807017543) internal successors, (391), 228 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 391 transitions. [2023-11-06 23:03:42,371 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 391 transitions. Word has length 46 [2023-11-06 23:03:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:42,372 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 391 transitions. [2023-11-06 23:03:42,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 391 transitions. [2023-11-06 23:03:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 23:03:42,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:42,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:42,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:03:42,377 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:42,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:42,377 INFO L85 PathProgramCache]: Analyzing trace with hash -713246528, now seen corresponding path program 1 times [2023-11-06 23:03:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140121363] [2023-11-06 23:03:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:42,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140121363] [2023-11-06 23:03:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140121363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173595697] [2023-11-06 23:03:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:42,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:42,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:42,522 INFO L87 Difference]: Start difference. First operand 229 states and 391 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:42,716 INFO L93 Difference]: Finished difference Result 477 states and 820 transitions. [2023-11-06 23:03:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2023-11-06 23:03:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:42,719 INFO L225 Difference]: With dead ends: 477 [2023-11-06 23:03:42,720 INFO L226 Difference]: Without dead ends: 260 [2023-11-06 23:03:42,728 INFO L412 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 [2023-11-06 23:03:42,731 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:42,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 195 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-06 23:03:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2023-11-06 23:03:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.725868725868726) internal successors, (447), 259 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 447 transitions. [2023-11-06 23:03:42,776 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 447 transitions. Word has length 74 [2023-11-06 23:03:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:42,779 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 447 transitions. [2023-11-06 23:03:42,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 447 transitions. [2023-11-06 23:03:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-06 23:03:42,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:42,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:42,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:03:42,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:42,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1645727145, now seen corresponding path program 1 times [2023-11-06 23:03:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:42,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333514678] [2023-11-06 23:03:42,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:42,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333514678] [2023-11-06 23:03:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333514678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:42,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423997417] [2023-11-06 23:03:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:42,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:42,913 INFO L87 Difference]: Start difference. First operand 260 states and 447 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:43,124 INFO L93 Difference]: Finished difference Result 554 states and 956 transitions. [2023-11-06 23:03:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 [2023-11-06 23:03:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:43,128 INFO L225 Difference]: With dead ends: 554 [2023-11-06 23:03:43,129 INFO L226 Difference]: Without dead ends: 306 [2023-11-06 23:03:43,130 INFO L412 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 [2023-11-06 23:03:43,140 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 171 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:43,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 183 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-11-06 23:03:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2023-11-06 23:03:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.73421926910299) internal successors, (522), 301 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 522 transitions. [2023-11-06 23:03:43,168 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 522 transitions. Word has length 85 [2023-11-06 23:03:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:43,168 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 522 transitions. [2023-11-06 23:03:43,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 522 transitions. [2023-11-06 23:03:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 23:03:43,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:43,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:43,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:03:43,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:43,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash 61325290, now seen corresponding path program 1 times [2023-11-06 23:03:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154265769] [2023-11-06 23:03:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:03:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154265769] [2023-11-06 23:03:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154265769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:43,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784360444] [2023-11-06 23:03:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:43,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:43,395 INFO L87 Difference]: Start difference. First operand 302 states and 522 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:43,556 INFO L93 Difference]: Finished difference Result 609 states and 1052 transitions. [2023-11-06 23:03:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:43,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2023-11-06 23:03:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:43,561 INFO L225 Difference]: With dead ends: 609 [2023-11-06 23:03:43,561 INFO L226 Difference]: Without dead ends: 319 [2023-11-06 23:03:43,562 INFO L412 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 [2023-11-06 23:03:43,563 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:43,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 189 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-11-06 23:03:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2023-11-06 23:03:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.7215189873417722) internal successors, (544), 316 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 544 transitions. [2023-11-06 23:03:43,595 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 544 transitions. Word has length 86 [2023-11-06 23:03:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:43,596 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 544 transitions. [2023-11-06 23:03:43,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 544 transitions. [2023-11-06 23:03:43,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 23:03:43,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:43,598 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:43,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:03:43,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:43,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1899593071, now seen corresponding path program 1 times [2023-11-06 23:03:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361477667] [2023-11-06 23:03:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:43,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:43,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361477667] [2023-11-06 23:03:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361477667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:43,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619897988] [2023-11-06 23:03:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:43,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:43,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:43,776 INFO L87 Difference]: Start difference. First operand 317 states and 544 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:43,979 INFO L93 Difference]: Finished difference Result 626 states and 1073 transitions. [2023-11-06 23:03:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:43,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2023-11-06 23:03:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:43,983 INFO L225 Difference]: With dead ends: 626 [2023-11-06 23:03:43,983 INFO L226 Difference]: Without dead ends: 319 [2023-11-06 23:03:43,984 INFO L412 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 [2023-11-06 23:03:43,985 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 169 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:43,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 181 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-11-06 23:03:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2023-11-06 23:03:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.71656050955414) internal successors, (539), 314 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 539 transitions. [2023-11-06 23:03:44,005 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 539 transitions. Word has length 86 [2023-11-06 23:03:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:44,006 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 539 transitions. [2023-11-06 23:03:44,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 539 transitions. [2023-11-06 23:03:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-06 23:03:44,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:44,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:44,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:03:44,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:44,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2126253793, now seen corresponding path program 1 times [2023-11-06 23:03:44,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:44,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968955157] [2023-11-06 23:03:44,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:03:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:44,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968955157] [2023-11-06 23:03:44,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968955157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:44,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:44,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689926808] [2023-11-06 23:03:44,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:44,098 INFO L87 Difference]: Start difference. First operand 315 states and 539 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:44,260 INFO L93 Difference]: Finished difference Result 620 states and 1060 transitions. [2023-11-06 23:03:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 87 [2023-11-06 23:03:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:44,264 INFO L225 Difference]: With dead ends: 620 [2023-11-06 23:03:44,264 INFO L226 Difference]: Without dead ends: 317 [2023-11-06 23:03:44,265 INFO L412 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 [2023-11-06 23:03:44,265 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 195 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:44,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 177 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-06 23:03:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2023-11-06 23:03:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.7038216560509554) internal successors, (535), 314 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 535 transitions. [2023-11-06 23:03:44,287 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 535 transitions. Word has length 87 [2023-11-06 23:03:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:44,287 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 535 transitions. [2023-11-06 23:03:44,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 535 transitions. [2023-11-06 23:03:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-06 23:03:44,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:44,289 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:44,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:03:44,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:44,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:44,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2061151769, now seen corresponding path program 1 times [2023-11-06 23:03:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888288318] [2023-11-06 23:03:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 23:03:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:44,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888288318] [2023-11-06 23:03:44,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888288318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:44,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:44,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384848963] [2023-11-06 23:03:44,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:44,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:44,399 INFO L87 Difference]: Start difference. First operand 315 states and 535 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:44,526 INFO L93 Difference]: Finished difference Result 626 states and 1061 transitions. [2023-11-06 23:03:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-11-06 23:03:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:44,529 INFO L225 Difference]: With dead ends: 626 [2023-11-06 23:03:44,529 INFO L226 Difference]: Without dead ends: 323 [2023-11-06 23:03:44,530 INFO L412 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 [2023-11-06 23:03:44,531 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 200 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:44,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 187 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:44,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-11-06 23:03:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-11-06 23:03:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.6770186335403727) internal successors, (540), 322 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 540 transitions. [2023-11-06 23:03:44,553 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 540 transitions. Word has length 99 [2023-11-06 23:03:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:44,554 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 540 transitions. [2023-11-06 23:03:44,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 540 transitions. [2023-11-06 23:03:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 23:03:44,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:44,556 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:03:44,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:03:44,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:44,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1658608487, now seen corresponding path program 1 times [2023-11-06 23:03:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:44,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869896463] [2023-11-06 23:03:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:03:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869896463] [2023-11-06 23:03:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869896463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:44,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479800241] [2023-11-06 23:03:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:44,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:44,652 INFO L87 Difference]: Start difference. First operand 323 states and 540 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:44,823 INFO L93 Difference]: Finished difference Result 665 states and 1113 transitions. [2023-11-06 23:03:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-11-06 23:03:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:44,827 INFO L225 Difference]: With dead ends: 665 [2023-11-06 23:03:44,828 INFO L226 Difference]: Without dead ends: 354 [2023-11-06 23:03:44,829 INFO L412 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 [2023-11-06 23:03:44,829 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 179 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:44,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 180 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-11-06 23:03:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2023-11-06 23:03:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.6723646723646723) internal successors, (587), 351 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 587 transitions. [2023-11-06 23:03:44,857 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 587 transitions. Word has length 100 [2023-11-06 23:03:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:44,858 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 587 transitions. [2023-11-06 23:03:44,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 587 transitions. [2023-11-06 23:03:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:03:44,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:44,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:03:44,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:03:44,861 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:44,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:44,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1148511100, now seen corresponding path program 1 times [2023-11-06 23:03:44,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:44,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143483810] [2023-11-06 23:03:44,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:03:44,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:44,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143483810] [2023-11-06 23:03:44,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143483810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:44,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752536705] [2023-11-06 23:03:44,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:44,978 INFO L87 Difference]: Start difference. First operand 352 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:45,162 INFO L93 Difference]: Finished difference Result 694 states and 1156 transitions. [2023-11-06 23:03:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:45,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-11-06 23:03:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:45,165 INFO L225 Difference]: With dead ends: 694 [2023-11-06 23:03:45,166 INFO L226 Difference]: Without dead ends: 354 [2023-11-06 23:03:45,166 INFO L412 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 [2023-11-06 23:03:45,167 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 178 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:45,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 180 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-11-06 23:03:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2023-11-06 23:03:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.660968660968661) internal successors, (583), 351 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 583 transitions. [2023-11-06 23:03:45,197 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 583 transitions. Word has length 101 [2023-11-06 23:03:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:45,197 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 583 transitions. [2023-11-06 23:03:45,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 583 transitions. [2023-11-06 23:03:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 23:03:45,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:45,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:45,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:03:45,200 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:45,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1425330041, now seen corresponding path program 1 times [2023-11-06 23:03:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:45,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744214790] [2023-11-06 23:03:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:03:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744214790] [2023-11-06 23:03:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744214790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:45,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244993832] [2023-11-06 23:03:45,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:45,307 INFO L87 Difference]: Start difference. First operand 352 states and 583 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:45,483 INFO L93 Difference]: Finished difference Result 732 states and 1217 transitions. [2023-11-06 23:03:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:45,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-11-06 23:03:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:45,488 INFO L225 Difference]: With dead ends: 732 [2023-11-06 23:03:45,488 INFO L226 Difference]: Without dead ends: 392 [2023-11-06 23:03:45,489 INFO L412 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 [2023-11-06 23:03:45,490 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 181 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:45,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 199 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-06 23:03:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 379. [2023-11-06 23:03:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.6534391534391535) internal successors, (625), 378 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 625 transitions. [2023-11-06 23:03:45,527 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 625 transitions. Word has length 102 [2023-11-06 23:03:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:45,528 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 625 transitions. [2023-11-06 23:03:45,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 625 transitions. [2023-11-06 23:03:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 23:03:45,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:45,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:45,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:03:45,531 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:45,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:45,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1410338066, now seen corresponding path program 1 times [2023-11-06 23:03:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738800349] [2023-11-06 23:03:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:03:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738800349] [2023-11-06 23:03:45,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738800349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:45,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:45,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888166516] [2023-11-06 23:03:45,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:45,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:45,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:45,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:45,671 INFO L87 Difference]: Start difference. First operand 379 states and 625 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:45,863 INFO L93 Difference]: Finished difference Result 759 states and 1254 transitions. [2023-11-06 23:03:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 103 [2023-11-06 23:03:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:45,867 INFO L225 Difference]: With dead ends: 759 [2023-11-06 23:03:45,868 INFO L226 Difference]: Without dead ends: 392 [2023-11-06 23:03:45,869 INFO L412 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 [2023-11-06 23:03:45,870 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 180 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:45,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 199 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-06 23:03:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 379. [2023-11-06 23:03:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.6402116402116402) internal successors, (620), 378 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 620 transitions. [2023-11-06 23:03:45,906 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 620 transitions. Word has length 103 [2023-11-06 23:03:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:45,906 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 620 transitions. [2023-11-06 23:03:45,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2023-11-06 23:03:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-06 23:03:45,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:45,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:45,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:03:45,909 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:45,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash -93392970, now seen corresponding path program 1 times [2023-11-06 23:03:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966340193] [2023-11-06 23:03:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 23:03:46,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:46,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966340193] [2023-11-06 23:03:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966340193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:46,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:46,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:46,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962807116] [2023-11-06 23:03:46,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:46,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:46,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:46,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:46,057 INFO L87 Difference]: Start difference. First operand 379 states and 620 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:46,232 INFO L93 Difference]: Finished difference Result 771 states and 1261 transitions. [2023-11-06 23:03:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:46,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 106 [2023-11-06 23:03:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:46,237 INFO L225 Difference]: With dead ends: 771 [2023-11-06 23:03:46,237 INFO L226 Difference]: Without dead ends: 404 [2023-11-06 23:03:46,238 INFO L412 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 [2023-11-06 23:03:46,239 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 187 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:46,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 183 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-11-06 23:03:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2023-11-06 23:03:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.6265664160401003) internal successors, (649), 399 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 649 transitions. [2023-11-06 23:03:46,278 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 649 transitions. Word has length 106 [2023-11-06 23:03:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:46,278 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 649 transitions. [2023-11-06 23:03:46,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 649 transitions. [2023-11-06 23:03:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 23:03:46,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:46,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:46,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:03:46,282 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:46,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1760843403, now seen corresponding path program 1 times [2023-11-06 23:03:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:46,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860043263] [2023-11-06 23:03:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 23:03:46,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:46,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860043263] [2023-11-06 23:03:46,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860043263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:46,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528754143] [2023-11-06 23:03:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:46,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:46,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:46,450 INFO L87 Difference]: Start difference. First operand 400 states and 649 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:46,641 INFO L93 Difference]: Finished difference Result 792 states and 1284 transitions. [2023-11-06 23:03:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:46,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 107 [2023-11-06 23:03:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:46,644 INFO L225 Difference]: With dead ends: 792 [2023-11-06 23:03:46,644 INFO L226 Difference]: Without dead ends: 404 [2023-11-06 23:03:46,645 INFO L412 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 [2023-11-06 23:03:46,646 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 186 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:46,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 183 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-11-06 23:03:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 400. [2023-11-06 23:03:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.6115288220551378) internal successors, (643), 399 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 643 transitions. [2023-11-06 23:03:46,691 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 643 transitions. Word has length 107 [2023-11-06 23:03:46,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:46,691 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 643 transitions. [2023-11-06 23:03:46,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,692 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 643 transitions. [2023-11-06 23:03:46,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:03:46,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:46,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:46,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:03:46,695 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:46,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -660005445, now seen corresponding path program 1 times [2023-11-06 23:03:46,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:46,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345389867] [2023-11-06 23:03:46,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-06 23:03:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:46,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345389867] [2023-11-06 23:03:46,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345389867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:46,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:46,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606911494] [2023-11-06 23:03:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:46,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:46,787 INFO L87 Difference]: Start difference. First operand 400 states and 643 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:46,891 INFO L93 Difference]: Finished difference Result 1170 states and 1883 transitions. [2023-11-06 23:03:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2023-11-06 23:03:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:46,897 INFO L225 Difference]: With dead ends: 1170 [2023-11-06 23:03:46,898 INFO L226 Difference]: Without dead ends: 782 [2023-11-06 23:03:46,900 INFO L412 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 [2023-11-06 23:03:46,901 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 163 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:46,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 643 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:46,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2023-11-06 23:03:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2023-11-06 23:03:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.6056338028169015) internal successors, (1254), 781 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1254 transitions. [2023-11-06 23:03:46,984 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1254 transitions. Word has length 122 [2023-11-06 23:03:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:46,985 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1254 transitions. [2023-11-06 23:03:46,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1254 transitions. [2023-11-06 23:03:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:03:46,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:46,988 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:46,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:03:46,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:46,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1557398723, now seen corresponding path program 1 times [2023-11-06 23:03:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:46,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486882849] [2023-11-06 23:03:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 23:03:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486882849] [2023-11-06 23:03:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486882849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:47,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661978832] [2023-11-06 23:03:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:47,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:47,076 INFO L87 Difference]: Start difference. First operand 782 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:47,242 INFO L93 Difference]: Finished difference Result 1894 states and 3041 transitions. [2023-11-06 23:03:47,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:47,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2023-11-06 23:03:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:47,250 INFO L225 Difference]: With dead ends: 1894 [2023-11-06 23:03:47,251 INFO L226 Difference]: Without dead ends: 1124 [2023-11-06 23:03:47,254 INFO L412 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 [2023-11-06 23:03:47,255 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 165 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 648 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 [2023-11-06 23:03:47,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 648 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-11-06 23:03:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2023-11-06 23:03:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1123 states have (on average 1.603739982190561) internal successors, (1801), 1123 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1801 transitions. [2023-11-06 23:03:47,369 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1801 transitions. Word has length 122 [2023-11-06 23:03:47,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:47,370 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1801 transitions. [2023-11-06 23:03:47,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1801 transitions. [2023-11-06 23:03:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:03:47,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:47,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:03:47,374 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:47,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash 858437627, now seen corresponding path program 1 times [2023-11-06 23:03:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985824851] [2023-11-06 23:03:47,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:47,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 23:03:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985824851] [2023-11-06 23:03:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985824851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:47,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790981394] [2023-11-06 23:03:47,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:47,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:47,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:47,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:47,442 INFO L87 Difference]: Start difference. First operand 1124 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:47,623 INFO L93 Difference]: Finished difference Result 2618 states and 4199 transitions. [2023-11-06 23:03:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:47,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 122 [2023-11-06 23:03:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:47,634 INFO L225 Difference]: With dead ends: 2618 [2023-11-06 23:03:47,634 INFO L226 Difference]: Without dead ends: 1506 [2023-11-06 23:03:47,636 INFO L412 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 [2023-11-06 23:03:47,637 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 185 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 651 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 [2023-11-06 23:03:47,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 651 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2023-11-06 23:03:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2023-11-06 23:03:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6026578073089701) internal successors, (2412), 1505 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2412 transitions. [2023-11-06 23:03:47,834 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2412 transitions. Word has length 122 [2023-11-06 23:03:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:47,835 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 2412 transitions. [2023-11-06 23:03:47,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2412 transitions. [2023-11-06 23:03:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 23:03:47,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:47,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:47,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:03:47,840 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:47,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:47,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1174956419, now seen corresponding path program 1 times [2023-11-06 23:03:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478977568] [2023-11-06 23:03:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:47,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-11-06 23:03:47,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:47,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478977568] [2023-11-06 23:03:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478977568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:47,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:47,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828134730] [2023-11-06 23:03:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:47,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:47,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:47,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:47,898 INFO L87 Difference]: Start difference. First operand 1506 states and 2412 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:48,116 INFO L93 Difference]: Finished difference Result 3364 states and 5390 transitions. [2023-11-06 23:03:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:48,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 122 [2023-11-06 23:03:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:48,129 INFO L225 Difference]: With dead ends: 3364 [2023-11-06 23:03:48,129 INFO L226 Difference]: Without dead ends: 1870 [2023-11-06 23:03:48,132 INFO L412 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 [2023-11-06 23:03:48,133 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 207 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 456 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 [2023-11-06 23:03:48,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2023-11-06 23:03:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1870. [2023-11-06 23:03:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1869 states have (on average 1.6008560727661851) internal successors, (2992), 1869 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2992 transitions. [2023-11-06 23:03:48,326 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2992 transitions. Word has length 122 [2023-11-06 23:03:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:48,326 INFO L495 AbstractCegarLoop]: Abstraction has 1870 states and 2992 transitions. [2023-11-06 23:03:48,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2992 transitions. [2023-11-06 23:03:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-11-06 23:03:48,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:48,333 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2023-11-06 23:03:48,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:03:48,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:48,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash -922938386, now seen corresponding path program 1 times [2023-11-06 23:03:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374470140] [2023-11-06 23:03:48,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:48,461 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-11-06 23:03:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:48,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374470140] [2023-11-06 23:03:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374470140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:48,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:48,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:48,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422128874] [2023-11-06 23:03:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:48,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:48,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:48,466 INFO L87 Difference]: Start difference. First operand 1870 states and 2992 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:48,816 INFO L93 Difference]: Finished difference Result 3773 states and 6019 transitions. [2023-11-06 23:03:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 200 [2023-11-06 23:03:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:48,829 INFO L225 Difference]: With dead ends: 3773 [2023-11-06 23:03:48,829 INFO L226 Difference]: Without dead ends: 1915 [2023-11-06 23:03:48,832 INFO L412 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 [2023-11-06 23:03:48,833 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 31 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:48,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 373 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2023-11-06 23:03:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1870. [2023-11-06 23:03:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1869 states have (on average 1.5623327982878545) internal successors, (2920), 1869 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2920 transitions. [2023-11-06 23:03:49,014 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2920 transitions. Word has length 200 [2023-11-06 23:03:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:49,014 INFO L495 AbstractCegarLoop]: Abstraction has 1870 states and 2920 transitions. [2023-11-06 23:03:49,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2920 transitions. [2023-11-06 23:03:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-06 23:03:49,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:49,024 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:49,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:03:49,025 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:49,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1086040052, now seen corresponding path program 1 times [2023-11-06 23:03:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773393248] [2023-11-06 23:03:49,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2023-11-06 23:03:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773393248] [2023-11-06 23:03:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773393248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415239548] [2023-11-06 23:03:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:49,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:49,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:49,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:49,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:49,154 INFO L87 Difference]: Start difference. First operand 1870 states and 2920 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:49,555 INFO L93 Difference]: Finished difference Result 3795 states and 5898 transitions. [2023-11-06 23:03:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2023-11-06 23:03:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:49,569 INFO L225 Difference]: With dead ends: 3795 [2023-11-06 23:03:49,569 INFO L226 Difference]: Without dead ends: 1937 [2023-11-06 23:03:49,572 INFO L412 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 [2023-11-06 23:03:49,573 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 191 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:49,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 203 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2023-11-06 23:03:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1870. [2023-11-06 23:03:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1869 states have (on average 1.521669341894061) internal successors, (2844), 1869 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2844 transitions. [2023-11-06 23:03:49,738 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2844 transitions. Word has length 214 [2023-11-06 23:03:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:49,739 INFO L495 AbstractCegarLoop]: Abstraction has 1870 states and 2844 transitions. [2023-11-06 23:03:49,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2844 transitions. [2023-11-06 23:03:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-11-06 23:03:49,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:49,746 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:49,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:03:49,747 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:49,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash -397080265, now seen corresponding path program 1 times [2023-11-06 23:03:49,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:49,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668656964] [2023-11-06 23:03:49,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-06 23:03:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:49,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668656964] [2023-11-06 23:03:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668656964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:49,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952890551] [2023-11-06 23:03:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:49,859 INFO L87 Difference]: Start difference. First operand 1870 states and 2844 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:50,172 INFO L93 Difference]: Finished difference Result 3728 states and 5668 transitions. [2023-11-06 23:03:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:50,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 243 [2023-11-06 23:03:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:50,184 INFO L225 Difference]: With dead ends: 3728 [2023-11-06 23:03:50,185 INFO L226 Difference]: Without dead ends: 1870 [2023-11-06 23:03:50,187 INFO L412 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 [2023-11-06 23:03:50,188 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 15 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:50,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 378 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2023-11-06 23:03:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1870. [2023-11-06 23:03:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1869 states have (on average 1.4922418405564473) internal successors, (2789), 1869 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2789 transitions. [2023-11-06 23:03:50,341 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2789 transitions. Word has length 243 [2023-11-06 23:03:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:50,341 INFO L495 AbstractCegarLoop]: Abstraction has 1870 states and 2789 transitions. [2023-11-06 23:03:50,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2789 transitions. [2023-11-06 23:03:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2023-11-06 23:03:50,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:50,350 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:50,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 23:03:50,350 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:50,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1473227031, now seen corresponding path program 1 times [2023-11-06 23:03:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885733777] [2023-11-06 23:03:50,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-11-06 23:03:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885733777] [2023-11-06 23:03:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885733777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098306657] [2023-11-06 23:03:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:50,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:50,476 INFO L87 Difference]: Start difference. First operand 1870 states and 2789 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:50,726 INFO L93 Difference]: Finished difference Result 5490 states and 8185 transitions. [2023-11-06 23:03:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2023-11-06 23:03:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:50,749 INFO L225 Difference]: With dead ends: 5490 [2023-11-06 23:03:50,749 INFO L226 Difference]: Without dead ends: 3632 [2023-11-06 23:03:50,753 INFO L412 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 [2023-11-06 23:03:50,755 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 152 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:50,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 649 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2023-11-06 23:03:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3630. [2023-11-06 23:03:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 1.4885643427941582) internal successors, (5402), 3629 states have internal predecessors, (5402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 5402 transitions. [2023-11-06 23:03:51,030 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 5402 transitions. Word has length 272 [2023-11-06 23:03:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:51,031 INFO L495 AbstractCegarLoop]: Abstraction has 3630 states and 5402 transitions. [2023-11-06 23:03:51,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 5402 transitions. [2023-11-06 23:03:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-06 23:03:51,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:51,044 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:51,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 23:03:51,045 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:51,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash -35819779, now seen corresponding path program 1 times [2023-11-06 23:03:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227225203] [2023-11-06 23:03:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 524 proven. 66 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2023-11-06 23:03:51,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:51,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227225203] [2023-11-06 23:03:51,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227225203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:51,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608618326] [2023-11-06 23:03:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:51,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:51,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:51,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:51,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:03:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:51,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:03:51,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-06 23:03:51,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:51,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608618326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:51,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:51,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-06 23:03:51,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703282991] [2023-11-06 23:03:51,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:51,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:51,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:51,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:51,707 INFO L87 Difference]: Start difference. First operand 3630 states and 5402 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:52,163 INFO L93 Difference]: Finished difference Result 7638 states and 11394 transitions. [2023-11-06 23:03:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 309 [2023-11-06 23:03:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:52,178 INFO L225 Difference]: With dead ends: 7638 [2023-11-06 23:03:52,178 INFO L226 Difference]: Without dead ends: 2193 [2023-11-06 23:03:52,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:52,185 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 30 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:52,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 374 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2023-11-06 23:03:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2193. [2023-11-06 23:03:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 2192 states have (on average 1.469890510948905) internal successors, (3222), 2192 states have internal predecessors, (3222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3222 transitions. [2023-11-06 23:03:52,357 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3222 transitions. Word has length 309 [2023-11-06 23:03:52,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:52,357 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 3222 transitions. [2023-11-06 23:03:52,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3222 transitions. [2023-11-06 23:03:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2023-11-06 23:03:52,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:52,366 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:52,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:52,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:52,573 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:52,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1466680599, now seen corresponding path program 1 times [2023-11-06 23:03:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:52,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813789947] [2023-11-06 23:03:52,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2023-11-06 23:03:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813789947] [2023-11-06 23:03:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813789947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527178180] [2023-11-06 23:03:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:52,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:52,682 INFO L87 Difference]: Start difference. First operand 2193 states and 3222 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:52,956 INFO L93 Difference]: Finished difference Result 4496 states and 6608 transitions. [2023-11-06 23:03:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:52,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 310 [2023-11-06 23:03:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:52,971 INFO L225 Difference]: With dead ends: 4496 [2023-11-06 23:03:52,971 INFO L226 Difference]: Without dead ends: 2315 [2023-11-06 23:03:52,975 INFO L412 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 [2023-11-06 23:03:52,976 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 16 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:52,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 383 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2023-11-06 23:03:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2285. [2023-11-06 23:03:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2284 states have (on average 1.4597197898423817) internal successors, (3334), 2284 states have internal predecessors, (3334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3334 transitions. [2023-11-06 23:03:53,161 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3334 transitions. Word has length 310 [2023-11-06 23:03:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:53,162 INFO L495 AbstractCegarLoop]: Abstraction has 2285 states and 3334 transitions. [2023-11-06 23:03:53,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3334 transitions. [2023-11-06 23:03:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2023-11-06 23:03:53,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:53,172 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:53,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 23:03:53,173 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:53,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -609193212, now seen corresponding path program 1 times [2023-11-06 23:03:53,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:53,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4261438] [2023-11-06 23:03:53,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2023-11-06 23:03:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4261438] [2023-11-06 23:03:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4261438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731153652] [2023-11-06 23:03:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:53,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:53,297 INFO L87 Difference]: Start difference. First operand 2285 states and 3334 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:53,573 INFO L93 Difference]: Finished difference Result 4828 states and 7092 transitions. [2023-11-06 23:03:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 331 [2023-11-06 23:03:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:53,602 INFO L225 Difference]: With dead ends: 4828 [2023-11-06 23:03:53,603 INFO L226 Difference]: Without dead ends: 2555 [2023-11-06 23:03:53,607 INFO L412 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 [2023-11-06 23:03:53,608 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 44 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:53,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 383 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2023-11-06 23:03:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2435. [2023-11-06 23:03:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2434 states have (on average 1.4437140509449466) internal successors, (3514), 2434 states have internal predecessors, (3514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3514 transitions. [2023-11-06 23:03:53,774 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3514 transitions. Word has length 331 [2023-11-06 23:03:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:53,774 INFO L495 AbstractCegarLoop]: Abstraction has 2435 states and 3514 transitions. [2023-11-06 23:03:53,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3514 transitions. [2023-11-06 23:03:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2023-11-06 23:03:53,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:53,786 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:53,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 23:03:53,787 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:53,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1829105860, now seen corresponding path program 1 times [2023-11-06 23:03:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247535082] [2023-11-06 23:03:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2023-11-06 23:03:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:53,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247535082] [2023-11-06 23:03:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247535082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111228872] [2023-11-06 23:03:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:53,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:53,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:53,909 INFO L87 Difference]: Start difference. First operand 2435 states and 3514 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:54,198 INFO L93 Difference]: Finished difference Result 4936 states and 7152 transitions. [2023-11-06 23:03:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:54,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2023-11-06 23:03:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:54,206 INFO L225 Difference]: With dead ends: 4936 [2023-11-06 23:03:54,206 INFO L226 Difference]: Without dead ends: 2513 [2023-11-06 23:03:54,210 INFO L412 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 [2023-11-06 23:03:54,212 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 30 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:54,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 382 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2023-11-06 23:03:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2435. [2023-11-06 23:03:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2434 states have (on average 1.419063270336894) internal successors, (3454), 2434 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3454 transitions. [2023-11-06 23:03:54,362 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3454 transitions. Word has length 358 [2023-11-06 23:03:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:54,362 INFO L495 AbstractCegarLoop]: Abstraction has 2435 states and 3454 transitions. [2023-11-06 23:03:54,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3454 transitions. [2023-11-06 23:03:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2023-11-06 23:03:54,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:54,374 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:54,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 23:03:54,375 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:54,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:54,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1959995597, now seen corresponding path program 1 times [2023-11-06 23:03:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120147968] [2023-11-06 23:03:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-11-06 23:03:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120147968] [2023-11-06 23:03:54,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120147968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341373450] [2023-11-06 23:03:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:54,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:54,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:54,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:03:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:03:54,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-11-06 23:03:54,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-11-06 23:03:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341373450] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:55,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-06 23:03:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986612003] [2023-11-06 23:03:55,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:55,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:55,118 INFO L87 Difference]: Start difference. First operand 2435 states and 3454 transitions. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:56,054 INFO L93 Difference]: Finished difference Result 6411 states and 9091 transitions. [2023-11-06 23:03:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:03:56,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 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 377 [2023-11-06 23:03:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:56,066 INFO L225 Difference]: With dead ends: 6411 [2023-11-06 23:03:56,067 INFO L226 Difference]: Without dead ends: 3850 [2023-11-06 23:03:56,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:03:56,072 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 633 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:56,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 816 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 23:03:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2023-11-06 23:03:56,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 2468. [2023-11-06 23:03:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2467 states have (on average 1.3992703688690717) internal successors, (3452), 2467 states have internal predecessors, (3452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3452 transitions. [2023-11-06 23:03:56,297 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3452 transitions. Word has length 377 [2023-11-06 23:03:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:56,298 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3452 transitions. [2023-11-06 23:03:56,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3452 transitions. [2023-11-06 23:03:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2023-11-06 23:03:56,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:56,316 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:56,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 23:03:56,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:56,523 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:56,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1114478682, now seen corresponding path program 1 times [2023-11-06 23:03:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57336795] [2023-11-06 23:03:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:56,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2023-11-06 23:03:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57336795] [2023-11-06 23:03:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57336795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915623211] [2023-11-06 23:03:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:56,707 INFO L87 Difference]: Start difference. First operand 2468 states and 3452 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:56,990 INFO L93 Difference]: Finished difference Result 4936 states and 6896 transitions. [2023-11-06 23:03:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 443 [2023-11-06 23:03:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:56,997 INFO L225 Difference]: With dead ends: 4936 [2023-11-06 23:03:56,997 INFO L226 Difference]: Without dead ends: 2480 [2023-11-06 23:03:57,002 INFO L412 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 [2023-11-06 23:03:57,002 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:57,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 373 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2023-11-06 23:03:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2468. [2023-11-06 23:03:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2467 states have (on average 1.3749493311714633) internal successors, (3392), 2467 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3392 transitions. [2023-11-06 23:03:57,194 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3392 transitions. Word has length 443 [2023-11-06 23:03:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:57,195 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3392 transitions. [2023-11-06 23:03:57,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3392 transitions. [2023-11-06 23:03:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2023-11-06 23:03:57,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:57,210 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:57,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 23:03:57,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:57,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2142838645, now seen corresponding path program 1 times [2023-11-06 23:03:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556006766] [2023-11-06 23:03:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2339 backedges. 1324 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2023-11-06 23:03:57,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:57,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556006766] [2023-11-06 23:03:57,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556006766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:57,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258644844] [2023-11-06 23:03:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:57,368 INFO L87 Difference]: Start difference. First operand 2468 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:57,654 INFO L93 Difference]: Finished difference Result 5140 states and 7082 transitions. [2023-11-06 23:03:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:57,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 477 [2023-11-06 23:03:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:57,661 INFO L225 Difference]: With dead ends: 5140 [2023-11-06 23:03:57,661 INFO L226 Difference]: Without dead ends: 2684 [2023-11-06 23:03:57,665 INFO L412 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 [2023-11-06 23:03:57,666 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:57,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 371 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2023-11-06 23:03:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2672. [2023-11-06 23:03:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2671 states have (on average 1.3575439910146012) internal successors, (3626), 2671 states have internal predecessors, (3626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3626 transitions. [2023-11-06 23:03:57,819 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 3626 transitions. Word has length 477 [2023-11-06 23:03:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:57,820 INFO L495 AbstractCegarLoop]: Abstraction has 2672 states and 3626 transitions. [2023-11-06 23:03:57,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3626 transitions. [2023-11-06 23:03:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2023-11-06 23:03:57,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:57,829 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:57,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 23:03:57,830 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:57,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1150333363, now seen corresponding path program 1 times [2023-11-06 23:03:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558798994] [2023-11-06 23:03:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2023-11-06 23:03:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558798994] [2023-11-06 23:03:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558798994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:58,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:58,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:58,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944088913] [2023-11-06 23:03:58,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:58,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:58,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:58,010 INFO L87 Difference]: Start difference. First operand 2672 states and 3626 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:58,303 INFO L93 Difference]: Finished difference Result 5560 states and 7574 transitions. [2023-11-06 23:03:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 539 [2023-11-06 23:03:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:58,311 INFO L225 Difference]: With dead ends: 5560 [2023-11-06 23:03:58,311 INFO L226 Difference]: Without dead ends: 2900 [2023-11-06 23:03:58,315 INFO L412 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 [2023-11-06 23:03:58,316 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:58,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 371 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2023-11-06 23:03:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2888. [2023-11-06 23:03:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2887 states have (on average 1.3411846207135434) internal successors, (3872), 2887 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3872 transitions. [2023-11-06 23:03:58,479 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3872 transitions. Word has length 539 [2023-11-06 23:03:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:58,480 INFO L495 AbstractCegarLoop]: Abstraction has 2888 states and 3872 transitions. [2023-11-06 23:03:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3872 transitions. [2023-11-06 23:03:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2023-11-06 23:03:58,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:58,490 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:58,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 23:03:58,491 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:58,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash -164778859, now seen corresponding path program 1 times [2023-11-06 23:03:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637574567] [2023-11-06 23:03:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-11-06 23:03:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637574567] [2023-11-06 23:03:58,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637574567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570373999] [2023-11-06 23:03:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:58,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:58,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:58,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:03:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:59,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:03:59,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-11-06 23:03:59,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2023-11-06 23:03:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570373999] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:59,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:59,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-11-06 23:03:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426871068] [2023-11-06 23:03:59,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:59,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:59,350 INFO L87 Difference]: Start difference. First operand 2888 states and 3872 transitions. Second operand has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:00,041 INFO L93 Difference]: Finished difference Result 5333 states and 7185 transitions. [2023-11-06 23:04:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:00,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 0 states have call successors, (0), 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 605 [2023-11-06 23:04:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:00,043 INFO L225 Difference]: With dead ends: 5333 [2023-11-06 23:04:00,043 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:04:00,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1218 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:04:00,050 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 272 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:00,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1193 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 23:04:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:04:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:04:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:04:00,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 605 [2023-11-06 23:04:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:00,052 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:04:00,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.5) internal successors, (340), 8 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:04:00,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:04:00,055 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 23:04:00,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:00,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:04:14,566 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2023-11-06 23:04:14,567 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 184 614) the Hoare annotation is: (let ((.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8655)) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse17 .cse15 .cse12))) [2023-11-06 23:04:14,568 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 157 623) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-06 23:04:14,568 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2023-11-06 23:04:14,568 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2023-11-06 23:04:14,568 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2023-11-06 23:04:14,569 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 145 627) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse8 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse15 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse6 .cse7 .cse11 .cse15 .cse12 .cse8 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse9 .cse14 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse13))) [2023-11-06 23:04:14,569 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2023-11-06 23:04:14,569 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2023-11-06 23:04:14,569 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-11-06 23:04:14,569 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 133 631) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-11-06 23:04:14,570 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-06 23:04:14,570 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2023-11-06 23:04:14,570 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2023-11-06 23:04:14,571 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2023-11-06 23:04:14,571 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2023-11-06 23:04:14,571 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2023-11-06 23:04:14,571 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2023-11-06 23:04:14,571 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2023-11-06 23:04:14,572 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2023-11-06 23:04:14,572 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2023-11-06 23:04:14,572 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-11-06 23:04:14,572 INFO L899 garLoopResultBuilder]: For program point L405-3(lines 405 425) no Hoare annotation was computed. [2023-11-06 23:04:14,572 INFO L902 garLoopResultBuilder]: At program point L670(lines 75 687) the Hoare annotation is: true [2023-11-06 23:04:14,572 INFO L899 garLoopResultBuilder]: For program point L406(line 406) no Hoare annotation was computed. [2023-11-06 23:04:14,573 INFO L899 garLoopResultBuilder]: For program point L406-2(line 406) no Hoare annotation was computed. [2023-11-06 23:04:14,573 INFO L899 garLoopResultBuilder]: For program point L406-4(lines 406 412) no Hoare annotation was computed. [2023-11-06 23:04:14,573 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2023-11-06 23:04:14,573 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2023-11-06 23:04:14,573 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2023-11-06 23:04:14,573 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2023-11-06 23:04:14,574 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse13 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse12 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse13)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse8 .cse10 .cse9) (and .cse4 .cse11) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4) (and .cse12 .cse6) (and .cse12 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse13) (and .cse12 .cse11) (and .cse14 .cse15 .cse16) (and .cse4 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse7 .cse8 .cse9) (and .cse10 .cse11) (and .cse14 .cse11) (and .cse15 .cse10 .cse16)))) [2023-11-06 23:04:14,574 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-11-06 23:04:14,574 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 689 700) the Hoare annotation is: true [2023-11-06 23:04:14,574 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2023-11-06 23:04:14,575 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-11-06 23:04:14,575 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2023-11-06 23:04:14,575 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2023-11-06 23:04:14,575 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2023-11-06 23:04:14,575 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2023-11-06 23:04:14,575 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2023-11-06 23:04:14,576 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 127 633) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5 .cse6 .cse12 .cse8 .cse13 .cse9 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse2 .cse3 .cse10 .cse16 .cse11 .cse4 .cse5 .cse6 .cse12 .cse13 .cse9 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse10 .cse11 .cse4 .cse5 .cse6 .cse12 .cse13 .cse9 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5 .cse6 .cse12 .cse13 .cse9 .cse14))) [2023-11-06 23:04:14,576 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2023-11-06 23:04:14,576 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2023-11-06 23:04:14,576 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2023-11-06 23:04:14,576 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2023-11-06 23:04:14,577 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2023-11-06 23:04:14,577 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2023-11-06 23:04:14,577 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2023-11-06 23:04:14,577 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2023-11-06 23:04:14,577 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2023-11-06 23:04:14,578 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2023-11-06 23:04:14,578 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2023-11-06 23:04:14,578 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2023-11-06 23:04:14,578 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2023-11-06 23:04:14,578 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2023-11-06 23:04:14,578 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2023-11-06 23:04:14,579 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2023-11-06 23:04:14,579 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8448#1(lines 175 617) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse1 .cse4 .cse2) (and .cse5 .cse1 .cse2) (and .cse6 .cse1 .cse2) (and .cse6 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1) (and .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse3))) [2023-11-06 23:04:14,579 INFO L899 garLoopResultBuilder]: For program point L347(line 347) no Hoare annotation was computed. [2023-11-06 23:04:14,579 INFO L899 garLoopResultBuilder]: For program point L347-2(line 347) no Hoare annotation was computed. [2023-11-06 23:04:14,579 INFO L899 garLoopResultBuilder]: For program point L347-4(lines 347 351) no Hoare annotation was computed. [2023-11-06 23:04:14,580 INFO L899 garLoopResultBuilder]: For program point L347-6(lines 219 600) no Hoare annotation was computed. [2023-11-06 23:04:14,580 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2023-11-06 23:04:14,580 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2023-11-06 23:04:14,580 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse14 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse15 .cse11) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse11))) [2023-11-06 23:04:14,580 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2023-11-06 23:04:14,581 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 202 608) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 .cse10))) [2023-11-06 23:04:14,581 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2023-11-06 23:04:14,581 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2023-11-06 23:04:14,581 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2023-11-06 23:04:14,581 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2023-11-06 23:04:14,582 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2023-11-06 23:04:14,582 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2023-11-06 23:04:14,582 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2023-11-06 23:04:14,582 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-11-06 23:04:14,582 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2023-11-06 23:04:14,582 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2023-11-06 23:04:14,583 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2023-11-06 23:04:14,583 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2023-11-06 23:04:14,583 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 214 604) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-11-06 23:04:14,583 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2023-11-06 23:04:14,583 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2023-11-06 23:04:14,583 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2023-11-06 23:04:14,584 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2023-11-06 23:04:14,584 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 217 603) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-11-06 23:04:14,584 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2023-11-06 23:04:14,584 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: (let ((.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15) (and .cse4 .cse16 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse15) (and .cse4 .cse16 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse4 .cse16 .cse5 .cse6 .cse7 .cse1 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse15) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse3 .cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)))) [2023-11-06 23:04:14,585 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 178 616) the Hoare annotation is: (let ((.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8655)) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse17 .cse15 .cse12))) [2023-11-06 23:04:14,585 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2023-11-06 23:04:14,585 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2023-11-06 23:04:14,585 INFO L899 garLoopResultBuilder]: For program point L355(line 355) no Hoare annotation was computed. [2023-11-06 23:04:14,586 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2023-11-06 23:04:14,586 INFO L899 garLoopResultBuilder]: For program point L355-2(line 355) no Hoare annotation was computed. [2023-11-06 23:04:14,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:04:14,586 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2023-11-06 23:04:14,586 INFO L899 garLoopResultBuilder]: For program point L355-4(lines 355 387) no Hoare annotation was computed. [2023-11-06 23:04:14,586 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2023-11-06 23:04:14,587 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2023-11-06 23:04:14,587 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2023-11-06 23:04:14,587 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 196 610) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8655)) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse8 .cse9))) [2023-11-06 23:04:14,587 INFO L895 garLoopResultBuilder]: At program point $Ultimate##195(lines 394 431) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse14 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse15 .cse11) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse11))) [2023-11-06 23:04:14,588 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2023-11-06 23:04:14,588 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 75 687) the Hoare annotation is: false [2023-11-06 23:04:14,588 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 20 688) the Hoare annotation is: true [2023-11-06 23:04:14,588 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-11-06 23:04:14,588 INFO L899 garLoopResultBuilder]: For program point L93-2(line 93) no Hoare annotation was computed. [2023-11-06 23:04:14,589 INFO L899 garLoopResultBuilder]: For program point L93-4(lines 93 101) no Hoare annotation was computed. [2023-11-06 23:04:14,589 INFO L899 garLoopResultBuilder]: For program point L93-5(lines 75 687) no Hoare annotation was computed. [2023-11-06 23:04:14,589 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2023-11-06 23:04:14,589 INFO L895 garLoopResultBuilder]: At program point $Ultimate##137(line 331) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-06 23:04:14,589 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2023-11-06 23:04:14,590 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2023-11-06 23:04:14,590 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2023-11-06 23:04:14,590 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2023-11-06 23:04:14,590 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2023-11-06 23:04:14,590 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 23:04:14,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:04:14,591 INFO L899 garLoopResultBuilder]: For program point L94-2(line 94) no Hoare annotation was computed. [2023-11-06 23:04:14,591 INFO L899 garLoopResultBuilder]: For program point L94-4(lines 94 98) no Hoare annotation was computed. [2023-11-06 23:04:14,591 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 208 606) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))))) [2023-11-06 23:04:14,591 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2023-11-06 23:04:14,592 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2023-11-06 23:04:14,592 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2023-11-06 23:04:14,592 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 190 612) the Hoare annotation is: (let ((.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8655)) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse17 .cse15 .cse12))) [2023-11-06 23:04:14,592 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:04:14,593 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2023-11-06 23:04:14,593 INFO L895 garLoopResultBuilder]: At program point $Ultimate##279(lines 639 667) the Hoare annotation is: (let ((.cse13 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse12 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse13)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse8 .cse10 .cse9) (and .cse4 .cse11) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4) (and .cse12 .cse6) (and .cse12 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse13) (and .cse12 .cse11) (and .cse14 .cse15 .cse16) (and .cse4 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse7 .cse8 .cse9) (and .cse10 .cse11) (and .cse14 .cse11) (and .cse15 .cse10 .cse16)))) [2023-11-06 23:04:14,593 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 136 630) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12) (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2023-11-06 23:04:14,593 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2023-11-06 23:04:14,594 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 112 638) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse3))) [2023-11-06 23:04:14,594 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2023-11-06 23:04:14,594 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2023-11-06 23:04:14,594 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2023-11-06 23:04:14,594 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2023-11-06 23:04:14,595 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2023-11-06 23:04:14,595 INFO L895 garLoopResultBuilder]: At program point $Ultimate##209(line 405) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse14 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse6 .cse7 .cse8 .cse15 .cse11) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse11))) [2023-11-06 23:04:14,595 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2023-11-06 23:04:14,595 INFO L899 garLoopResultBuilder]: For program point L362(line 362) no Hoare annotation was computed. [2023-11-06 23:04:14,595 INFO L899 garLoopResultBuilder]: For program point L362-2(line 362) no Hoare annotation was computed. [2023-11-06 23:04:14,596 INFO L899 garLoopResultBuilder]: For program point L362-4(lines 362 382) no Hoare annotation was computed. [2023-11-06 23:04:14,596 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:04:14,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 681) no Hoare annotation was computed. [2023-11-06 23:04:14,596 INFO L899 garLoopResultBuilder]: For program point L396(line 396) no Hoare annotation was computed. [2023-11-06 23:04:14,596 INFO L899 garLoopResultBuilder]: For program point L396-2(line 396) no Hoare annotation was computed. [2023-11-06 23:04:14,597 INFO L899 garLoopResultBuilder]: For program point L396-4(lines 396 402) no Hoare annotation was computed. [2023-11-06 23:04:14,597 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 169 619) the Hoare annotation is: (let ((.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8575)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse13 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12))) [2023-11-06 23:04:14,597 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2023-11-06 23:04:14,597 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2023-11-06 23:04:14,597 INFO L899 garLoopResultBuilder]: For program point L364(line 364) no Hoare annotation was computed. [2023-11-06 23:04:14,598 INFO L899 garLoopResultBuilder]: For program point L331-1(line 331) no Hoare annotation was computed. [2023-11-06 23:04:14,598 INFO L899 garLoopResultBuilder]: For program point L364-2(line 364) no Hoare annotation was computed. [2023-11-06 23:04:14,598 INFO L899 garLoopResultBuilder]: For program point L331-3(lines 331 340) no Hoare annotation was computed. [2023-11-06 23:04:14,598 INFO L899 garLoopResultBuilder]: For program point L364-4(lines 364 368) no Hoare annotation was computed. [2023-11-06 23:04:14,598 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2023-11-06 23:04:14,598 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2023-11-06 23:04:14,599 INFO L899 garLoopResultBuilder]: For program point L331-5(lines 331 340) no Hoare annotation was computed. [2023-11-06 23:04:14,599 INFO L899 garLoopResultBuilder]: For program point L364-6(lines 362 380) no Hoare annotation was computed. [2023-11-06 23:04:14,599 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2023-11-06 23:04:14,599 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2023-11-06 23:04:14,603 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:14,605 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:04:14,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:14 BoogieIcfgContainer [2023-11-06 23:04:14,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:04:14,750 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:04:14,750 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:04:14,750 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:04:14,751 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:40" (3/4) ... [2023-11-06 23:04:14,755 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:04:14,777 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 23:04:14,779 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:04:14,780 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:04:14,782 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:04:15,000 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:04:15,002 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:04:15,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:04:15,003 INFO L158 Benchmark]: Toolchain (without parser) took 36211.07ms. Allocated memory was 117.4MB in the beginning and 650.1MB in the end (delta: 532.7MB). Free memory was 71.2MB in the beginning and 239.3MB in the end (delta: -168.1MB). Peak memory consumption was 365.2MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,003 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 83.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:15,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.34ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 70.9MB in the beginning and 132.6MB in the end (delta: -61.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.79ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 129.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,005 INFO L158 Benchmark]: Boogie Preprocessor took 69.35ms. Allocated memory is still 161.5MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,005 INFO L158 Benchmark]: RCFGBuilder took 1066.45ms. Allocated memory is still 161.5MB. Free memory was 127.5MB in the beginning and 89.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,006 INFO L158 Benchmark]: TraceAbstraction took 34230.39ms. Allocated memory was 161.5MB in the beginning and 650.1MB in the end (delta: 488.6MB). Free memory was 89.6MB in the beginning and 255.0MB in the end (delta: -165.5MB). Peak memory consumption was 360.0MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,006 INFO L158 Benchmark]: Witness Printer took 252.59ms. Allocated memory is still 650.1MB. Free memory was 254.0MB in the beginning and 239.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:04:15,008 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.24ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 83.8MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.34ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 70.9MB in the beginning and 132.6MB in the end (delta: -61.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.79ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 129.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.35ms. Allocated memory is still 161.5MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1066.45ms. Allocated memory is still 161.5MB. Free memory was 127.5MB in the beginning and 89.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34230.39ms. Allocated memory was 161.5MB in the beginning and 650.1MB in the end (delta: 488.6MB). Free memory was 89.6MB in the beginning and 255.0MB in the end (delta: -165.5MB). Peak memory consumption was 360.0MB. Max. memory is 16.1GB. * Witness Printer took 252.59ms. Allocated memory is still 650.1MB. Free memory was 254.0MB in the beginning and 239.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 681]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 31, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4734 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4734 mSDsluCounter, 11297 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4046 mSDsCounter, 940 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3649 IncrementalHoareTripleChecker+Invalid, 4589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 940 mSolverCounterUnsat, 7251 mSDtfsCounter, 3649 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2379 GetRequests, 2331 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3630occurred in iteration=22, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 1822 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 438 NumberOfFragments, 5869 HoareAnnotationTreeSize, 29 FomulaSimplifications, 41476 FormulaSimplificationTreeSizeReduction, 4.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 17881 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 7684 NumberOfCodeBlocks, 7684 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8630 ConstructedInterpolants, 0 QuantifiedInterpolants, 11691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2020 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 36 InterpolantComputations, 29 PerfectInterpolantSequences, 31259/31481 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((8672 <= s__state) && !((8673 == s__state))) && (3 == blastFlag)) && !((s__state == 8672))) && !((0 == s__hit))) || (((((8672 <= s__state) && !((8673 == s__state))) && (2 == blastFlag)) && !((s__state == 8672))) && !((0 == s__hit)))) || (((((8672 <= s__state) && !((8673 == s__state))) && (blastFlag == 1)) && !((s__state == 8672))) && !((0 == s__hit)))) || (((((8672 <= s__state) && !((8673 == s__state))) && !((s__state == 8672))) && (blastFlag == 0)) && !((0 == s__hit)))) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((((blastFlag == 1) && (8448 == s__state)) && !((0 == s__hit))) || (((8448 == s__state) && (s__s3__tmp__next_state___0 <= 8576)) && (blastFlag == 0))) || (((8448 == s__state) && (blastFlag == 0)) && !((0 == s__hit)))) || (((2 == blastFlag) && (8448 == s__state)) && !((0 == s__hit)))) || (((3 == blastFlag) && (8448 == s__state)) && !((0 == s__hit)))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || (((blastFlag == 1) && (8448 == s__state)) && (s__s3__tmp__next_state___0 <= 8576))) || (((2 == blastFlag) && (8448 == s__state)) && (s__s3__tmp__next_state___0 <= 8576))) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((s__state == 8480))) && (s__state <= 8672)) || (((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && (s__state <= 8672))) || ((2 == blastFlag) && !((0 == s__hit)))) || (s__state < 4)) || ((3 == blastFlag) && (s__state == 8672))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && !((0 == s__hit)))) || (((blastFlag == 1) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || ((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((8497 == s__state))) && !((s__state == 8480))) && (s__state <= 8672))) || ((blastFlag == 0) && !((0 == s__hit)))) || ((blastFlag == 1) && !((0 == s__hit)))) || (((s__s3__tmp__next_state___0 <= 8576) && (blastFlag == 0)) && (s__state <= 8576))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state))) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || (((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__s3__tmp__next_state___0 <= 8576)) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((((((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && (s__state <= 8655)) && !((8560 == s__state)))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && (s__state <= 8655)) && !((8560 == s__state)))) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && (s__state <= 8655)) && !((8560 == s__state)))) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((8672 <= s__state) && (blastFlag == 1)) && !((12292 == s__state))) || (((8672 <= s__state) && !((12292 == s__state))) && (blastFlag == 0))) || (((8672 <= s__state) && (3 == blastFlag)) && !((12292 == s__state)))) || ((((8672 <= s__state) && (2 == blastFlag)) && !((12292 == s__state))) && !((0 == s__hit)))) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && (s__s3__tmp__next_state___0 <= 8576)) && (blastFlag == 0)) && !((8560 == s__state))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || (((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && (s__s3__tmp__next_state___0 <= 8576)) && !((8560 == s__state)))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || (((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && (s__s3__tmp__next_state___0 <= 8576)) && !((8560 == s__state)))) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state))) || (((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (s__state <= 8655)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && (s__state <= 8655)) && !((8560 == s__state)))) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((((8672 <= s__state) && !((8673 == s__state))) && (2 == blastFlag)) && !((s__state == 8672))) && !((0 == s__hit))) || ((((((((((((((!((8673 == s__state)) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8673 == s__state)) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((((!((8673 == s__state)) && (3 == blastFlag)) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state)))) || ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !((s__state == 8672)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((8560 == s__state))) && (s__state <= 8672)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((!((8448 == s__state)) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && (s__state <= 8672)) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480)))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8545))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480)))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && (s__state <= 8672))) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((((((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672)) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && (blastFlag == 1)) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8481))) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((s__state == 8656))) && (blastFlag == 0)) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state)))) || ((((((((!((8448 == s__state)) && (s__state <= 8575)) && !((s__state == 8561))) && !((s__state == 8481))) && (2 == blastFlag)) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && !((8560 == s__state)))) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state))) && (s__state <= 8672)) || (((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (blastFlag == 1)) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((8560 == s__state))) && (s__state <= 8672))) || (((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && !((8560 == s__state))) && (s__state <= 8672))) || (((((((((((((3 == blastFlag) && !((8448 == s__state))) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8672))) && !((8497 == s__state))) && !((8496 == s__state))) && !((8544 == s__state))) && !((s__state == 8480))) && !((0 == s__hit))) && !((8560 == s__state))) && (s__state <= 8672))) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && (2 == blastFlag)) && !((s__state == 8657))) && !((s__state == 8672))) && !((8497 == s__state))) && !((s__state == 8480))) && (s__state <= 8672)) || (((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && !((8497 == s__state))) && !((8496 == s__state))) && !((s__state == 8480))) && (blastFlag == 0)) && (s__state <= 8672))) || ((2 == blastFlag) && !((0 == s__hit)))) || (s__state < 4)) || ((3 == blastFlag) && (s__state == 8672))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && !((0 == s__hit)))) || (((blastFlag == 1) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || ((((((((!((8448 == s__state)) && !((s__state == 8561))) && !((s__state == 8545))) && !((s__state == 8481))) && !((s__state == 8657))) && (blastFlag == 1)) && !((8497 == s__state))) && !((s__state == 8480))) && (s__state <= 8672))) || ((blastFlag == 0) && !((0 == s__hit)))) || ((blastFlag == 1) && !((0 == s__hit)))) || (((s__s3__tmp__next_state___0 <= 8576) && (blastFlag == 0)) && (s__state <= 8576))) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !((s__state == 8672)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 23:04:15,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e1f75c3-293e-49b3-b454-32807add432f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE