/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/s3_srvr_2a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:40:06,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:40:06,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:40:06,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:40:06,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:40:06,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:40:06,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:40:06,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:40:06,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:40:06,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:40:06,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:40:06,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:40:06,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:40:06,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:40:06,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:40:06,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:40:06,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:40:06,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:40:06,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:40:06,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:40:06,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:40:06,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:40:06,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:40:06,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:40:06,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:40:06,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:40:06,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:40:06,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:40:06,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:40:06,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:40:06,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:40:06,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:40:06,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:40:06,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:40:06,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:40:06,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:40:06,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:40:06,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:40:06,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:40:06,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:40:06,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:40:06,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 02:40:06,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:40:06,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:40:06,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:40:06,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:40:06,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:40:06,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:40:06,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:40:06,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:40:06,404 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:40:06,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:40:06,405 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:40:06,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:40:06,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:40:06,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:40:06,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:40:06,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:40:06,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:06,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:40:06,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:40:06,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:40:06,407 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:40:06,407 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:06,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:40:06,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:40:06,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:40:06,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:40:06,408 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:40:06,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:40:06,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:40:06,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:40:06,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:40:06,632 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:40:06,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_2a.BV.c.cil.c [2022-01-10 02:40:06,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a5d2fc5/865a5493e66e465c9f948292cfb81ab7/FLAGe08ccdbf2 [2022-01-10 02:40:07,111 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:40:07,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a.BV.c.cil.c [2022-01-10 02:40:07,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a5d2fc5/865a5493e66e465c9f948292cfb81ab7/FLAGe08ccdbf2 [2022-01-10 02:40:07,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a5d2fc5/865a5493e66e465c9f948292cfb81ab7 [2022-01-10 02:40:07,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:40:07,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:40:07,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:07,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:40:07,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:40:07,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe03bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07, skipping insertion in model container [2022-01-10 02:40:07,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:40:07,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:40:07,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2022-01-10 02:40:07,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:07,405 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:40:07,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2022-01-10 02:40:07,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:07,445 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:40:07,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07 WrapperNode [2022-01-10 02:40:07,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:07,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:07,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:40:07,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:40:07,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,500 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 486 [2022-01-10 02:40:07,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:07,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:40:07,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:40:07,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:40:07,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:40:07,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:40:07,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:40:07,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:40:07,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (1/1) ... [2022-01-10 02:40:07,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:40:07,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:40:07,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:40:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:40:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:40:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:40:07,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:40:07,724 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:40:07,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:40:07,734 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 02:40:08,145 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 02:40:08,146 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 02:40:08,146 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:40:08,154 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:40:08,154 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 02:40:08,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:08 BoogieIcfgContainer [2022-01-10 02:40:08,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:40:08,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:40:08,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:40:08,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:40:08,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:07" (1/3) ... [2022-01-10 02:40:08,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cfa26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:08, skipping insertion in model container [2022-01-10 02:40:08,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:07" (2/3) ... [2022-01-10 02:40:08,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cfa26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:08, skipping insertion in model container [2022-01-10 02:40:08,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:08" (3/3) ... [2022-01-10 02:40:08,163 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2022-01-10 02:40:08,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:40:08,166 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:40:08,200 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:40:08,207 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:40:08,207 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:40:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:08,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 02:40:08,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:08,241 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:40:08,241 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2022-01-10 02:40:08,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:08,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102071537] [2022-01-10 02:40:08,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:08,259 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:08,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:08,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 02:40:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:08,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:08,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:40:08,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:08,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:08,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102071537] [2022-01-10 02:40:08,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102071537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:08,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:08,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:08,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098865297] [2022-01-10 02:40:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:08,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:08,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:08,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:08,521 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:08,677 INFO L93 Difference]: Finished difference Result 284 states and 484 transitions. [2022-01-10 02:40:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-10 02:40:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:08,688 INFO L225 Difference]: With dead ends: 284 [2022-01-10 02:40:08,688 INFO L226 Difference]: Without dead ends: 128 [2022-01-10 02:40:08,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:08,694 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:08,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 326 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-10 02:40:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2022-01-10 02:40:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2022-01-10 02:40:08,732 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2022-01-10 02:40:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:08,732 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2022-01-10 02:40:08,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2022-01-10 02:40:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 02:40:08,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:08,734 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 02:40:08,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:08,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:08,942 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:08,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:08,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2022-01-10 02:40:08,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:08,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236100487] [2022-01-10 02:40:08,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:08,943 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:08,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:08,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:08,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 02:40:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:08,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:08,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:40:09,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:09,129 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236100487] [2022-01-10 02:40:09,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236100487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:09,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:09,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:09,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051766858] [2022-01-10 02:40:09,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:09,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:09,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:09,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:09,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,132 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:09,172 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2022-01-10 02:40:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:09,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 02:40:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:09,175 INFO L225 Difference]: With dead ends: 331 [2022-01-10 02:40:09,175 INFO L226 Difference]: Without dead ends: 225 [2022-01-10 02:40:09,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,177 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:09,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 346 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-01-10 02:40:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-01-10 02:40:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.5) internal successors, (336), 224 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 336 transitions. [2022-01-10 02:40:09,193 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 336 transitions. Word has length 60 [2022-01-10 02:40:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:09,194 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 336 transitions. [2022-01-10 02:40:09,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 336 transitions. [2022-01-10 02:40:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 02:40:09,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,197 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 02:40:09,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:09,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:09,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2013663709, now seen corresponding path program 1 times [2022-01-10 02:40:09,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:09,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715242089] [2022-01-10 02:40:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:09,413 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:09,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:09,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 02:40:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:09,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:09,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:40:09,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:09,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:09,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715242089] [2022-01-10 02:40:09,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715242089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:09,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:09,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:09,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363135613] [2022-01-10 02:40:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:09,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:09,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:09,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,561 INFO L87 Difference]: Start difference. First operand 225 states and 336 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:09,577 INFO L93 Difference]: Finished difference Result 433 states and 652 transitions. [2022-01-10 02:40:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 02:40:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:09,579 INFO L225 Difference]: With dead ends: 433 [2022-01-10 02:40:09,579 INFO L226 Difference]: Without dead ends: 227 [2022-01-10 02:40:09,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,581 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:09,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-01-10 02:40:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-01-10 02:40:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4955752212389382) internal successors, (338), 226 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 338 transitions. [2022-01-10 02:40:09,596 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 338 transitions. Word has length 60 [2022-01-10 02:40:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:09,596 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 338 transitions. [2022-01-10 02:40:09,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 338 transitions. [2022-01-10 02:40:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:40:09,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,598 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:09,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:09,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 64836761, now seen corresponding path program 1 times [2022-01-10 02:40:09,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:09,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486773100] [2022-01-10 02:40:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:09,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:09,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:09,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 02:40:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:09,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:09,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 02:40:10,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:10,036 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486773100] [2022-01-10 02:40:10,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486773100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:10,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:10,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:10,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512188608] [2022-01-10 02:40:10,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:10,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,040 INFO L87 Difference]: Start difference. First operand 227 states and 338 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,210 INFO L93 Difference]: Finished difference Result 524 states and 805 transitions. [2022-01-10 02:40:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2022-01-10 02:40:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,215 INFO L225 Difference]: With dead ends: 524 [2022-01-10 02:40:10,215 INFO L226 Difference]: Without dead ends: 318 [2022-01-10 02:40:10,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,217 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 272 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:40:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-01-10 02:40:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2022-01-10 02:40:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3948220064724919) internal successors, (431), 309 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 431 transitions. [2022-01-10 02:40:10,227 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 431 transitions. Word has length 81 [2022-01-10 02:40:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,227 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 431 transitions. [2022-01-10 02:40:10,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2022-01-10 02:40:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:40:10,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,229 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:10,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:10,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,429 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash 312983255, now seen corresponding path program 1 times [2022-01-10 02:40:10,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:10,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269865345] [2022-01-10 02:40:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:10,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:10,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:10,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 02:40:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:10,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:10,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 02:40:10,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:10,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269865345] [2022-01-10 02:40:10,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269865345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:10,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:10,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:10,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220547077] [2022-01-10 02:40:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:10,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,585 INFO L87 Difference]: Start difference. First operand 310 states and 431 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,700 INFO L93 Difference]: Finished difference Result 628 states and 882 transitions. [2022-01-10 02:40:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:10,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 81 [2022-01-10 02:40:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,704 INFO L225 Difference]: With dead ends: 628 [2022-01-10 02:40:10,704 INFO L226 Difference]: Without dead ends: 339 [2022-01-10 02:40:10,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,705 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 273 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-01-10 02:40:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2022-01-10 02:40:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.3825301204819278) internal successors, (459), 332 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 459 transitions. [2022-01-10 02:40:10,716 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 459 transitions. Word has length 81 [2022-01-10 02:40:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,716 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 459 transitions. [2022-01-10 02:40:10,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 459 transitions. [2022-01-10 02:40:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:40:10,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,717 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:10,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 02:40:10,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,924 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:10,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1731331013, now seen corresponding path program 1 times [2022-01-10 02:40:10,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:10,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954477255] [2022-01-10 02:40:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:10,925 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:10,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:10,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 02:40:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:10,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:10,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:40:11,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,143 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954477255] [2022-01-10 02:40:11,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954477255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990427016] [2022-01-10 02:40:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,144 INFO L87 Difference]: Start difference. First operand 333 states and 459 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) [2022-01-10 02:40:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:11,230 INFO L93 Difference]: Finished difference Result 719 states and 1015 transitions. [2022-01-10 02:40:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:11,231 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 [2022-01-10 02:40:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:11,232 INFO L225 Difference]: With dead ends: 719 [2022-01-10 02:40:11,233 INFO L226 Difference]: Without dead ends: 407 [2022-01-10 02:40:11,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,234 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:11,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-01-10 02:40:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2022-01-10 02:40:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.3586387434554974) internal successors, (519), 382 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2022-01-10 02:40:11,241 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 101 [2022-01-10 02:40:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:11,242 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2022-01-10 02:40:11,242 INFO L471 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) [2022-01-10 02:40:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2022-01-10 02:40:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:11,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:11,243 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:40:11,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 02:40:11,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,452 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1340556462, now seen corresponding path program 1 times [2022-01-10 02:40:11,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379042355] [2022-01-10 02:40:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,453 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,454 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:11,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 02:40:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:11,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:11,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:40:11,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,702 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379042355] [2022-01-10 02:40:11,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379042355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438310662] [2022-01-10 02:40:11,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,704 INFO L87 Difference]: Start difference. First operand 383 states and 519 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:11,751 INFO L93 Difference]: Finished difference Result 912 states and 1246 transitions. [2022-01-10 02:40:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 121 [2022-01-10 02:40:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:11,753 INFO L225 Difference]: With dead ends: 912 [2022-01-10 02:40:11,753 INFO L226 Difference]: Without dead ends: 550 [2022-01-10 02:40:11,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,755 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:11,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 482 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-01-10 02:40:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2022-01-10 02:40:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.360655737704918) internal successors, (747), 549 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 747 transitions. [2022-01-10 02:40:11,766 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 747 transitions. Word has length 121 [2022-01-10 02:40:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:11,771 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 747 transitions. [2022-01-10 02:40:11,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 747 transitions. [2022-01-10 02:40:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:11,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:11,773 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:40:11,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 02:40:11,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,979 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2057017556, now seen corresponding path program 1 times [2022-01-10 02:40:11,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900825724] [2022-01-10 02:40:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,981 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:11,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 02:40:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 02:40:12,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:12,181 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:12,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900825724] [2022-01-10 02:40:12,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900825724] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:12,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:12,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:12,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970000304] [2022-01-10 02:40:12,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:12,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:12,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:12,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:12,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,182 INFO L87 Difference]: Start difference. First operand 550 states and 747 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,225 INFO L93 Difference]: Finished difference Result 1271 states and 1733 transitions. [2022-01-10 02:40:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 121 [2022-01-10 02:40:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,228 INFO L225 Difference]: With dead ends: 1271 [2022-01-10 02:40:12,228 INFO L226 Difference]: Without dead ends: 742 [2022-01-10 02:40:12,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,229 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 480 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-01-10 02:40:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2022-01-10 02:40:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.3576248313090418) internal successors, (1006), 741 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1006 transitions. [2022-01-10 02:40:12,240 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1006 transitions. Word has length 121 [2022-01-10 02:40:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,240 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1006 transitions. [2022-01-10 02:40:12,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1006 transitions. [2022-01-10 02:40:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-10 02:40:12,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,242 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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] [2022-01-10 02:40:12,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:12,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,449 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1067369758, now seen corresponding path program 1 times [2022-01-10 02:40:12,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643346944] [2022-01-10 02:40:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,450 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,450 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:12,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 02:40:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-10 02:40:12,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:12,731 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:12,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643346944] [2022-01-10 02:40:12,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643346944] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:12,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:12,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:12,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233016212] [2022-01-10 02:40:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:12,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:12,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,732 INFO L87 Difference]: Start difference. First operand 742 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,839 INFO L93 Difference]: Finished difference Result 1603 states and 2226 transitions. [2022-01-10 02:40:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 183 [2022-01-10 02:40:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,842 INFO L225 Difference]: With dead ends: 1603 [2022-01-10 02:40:12,842 INFO L226 Difference]: Without dead ends: 882 [2022-01-10 02:40:12,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,844 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 34 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 271 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-01-10 02:40:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 868. [2022-01-10 02:40:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.322952710495963) internal successors, (1147), 867 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1147 transitions. [2022-01-10 02:40:12,857 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1147 transitions. Word has length 183 [2022-01-10 02:40:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,858 INFO L470 AbstractCegarLoop]: Abstraction has 868 states and 1147 transitions. [2022-01-10 02:40:12,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1147 transitions. [2022-01-10 02:40:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-10 02:40:12,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,860 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:12,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:13,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,067 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:13,067 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2022-01-10 02:40:13,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:13,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723857311] [2022-01-10 02:40:13,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:13,068 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:13,069 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:13,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 02:40:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:13,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:13,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 02:40:13,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:13,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:13,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723857311] [2022-01-10 02:40:13,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723857311] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:13,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:13,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:13,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093198976] [2022-01-10 02:40:13,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:13,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:13,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:13,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:13,368 INFO L87 Difference]: Start difference. First operand 868 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:13,462 INFO L93 Difference]: Finished difference Result 1839 states and 2481 transitions. [2022-01-10 02:40:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 225 [2022-01-10 02:40:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:13,465 INFO L225 Difference]: With dead ends: 1839 [2022-01-10 02:40:13,466 INFO L226 Difference]: Without dead ends: 992 [2022-01-10 02:40:13,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:13,467 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:13,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 266 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-01-10 02:40:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2022-01-10 02:40:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.3027245206861755) internal successors, (1291), 991 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1291 transitions. [2022-01-10 02:40:13,482 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1291 transitions. Word has length 225 [2022-01-10 02:40:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:13,483 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1291 transitions. [2022-01-10 02:40:13,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1291 transitions. [2022-01-10 02:40:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-10 02:40:13,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:13,485 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:13,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:13,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,692 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2022-01-10 02:40:13,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:13,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382829551] [2022-01-10 02:40:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:13,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:13,694 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:13,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 02:40:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:13,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:13,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 02:40:14,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 02:40:14,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:14,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382829551] [2022-01-10 02:40:14,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382829551] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:14,338 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:14,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:40:14,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192389002] [2022-01-10 02:40:14,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:14,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:14,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:14,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:14,340 INFO L87 Difference]: Start difference. First operand 992 states and 1291 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:14,928 INFO L93 Difference]: Finished difference Result 4037 states and 5494 transitions. [2022-01-10 02:40:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:40:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 253 [2022-01-10 02:40:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:14,939 INFO L225 Difference]: With dead ends: 4037 [2022-01-10 02:40:14,940 INFO L226 Difference]: Without dead ends: 3066 [2022-01-10 02:40:14,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:40:14,943 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 486 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:14,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 976 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:40:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2022-01-10 02:40:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 2422. [2022-01-10 02:40:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2421 states have (on average 1.335811648079306) internal successors, (3234), 2421 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3234 transitions. [2022-01-10 02:40:15,007 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3234 transitions. Word has length 253 [2022-01-10 02:40:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:15,008 INFO L470 AbstractCegarLoop]: Abstraction has 2422 states and 3234 transitions. [2022-01-10 02:40:15,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3234 transitions. [2022-01-10 02:40:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-01-10 02:40:15,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:15,014 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:15,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:15,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:15,223 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1040352376, now seen corresponding path program 1 times [2022-01-10 02:40:15,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:15,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722519443] [2022-01-10 02:40:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:15,224 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:15,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:15,226 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:15,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 02:40:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:15,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:15,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-01-10 02:40:15,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:15,651 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:15,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722519443] [2022-01-10 02:40:15,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722519443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:15,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:15,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:15,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612762573] [2022-01-10 02:40:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:15,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:15,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:15,652 INFO L87 Difference]: Start difference. First operand 2422 states and 3234 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:15,699 INFO L93 Difference]: Finished difference Result 6005 states and 8023 transitions. [2022-01-10 02:40:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 254 [2022-01-10 02:40:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:15,709 INFO L225 Difference]: With dead ends: 6005 [2022-01-10 02:40:15,710 INFO L226 Difference]: Without dead ends: 3768 [2022-01-10 02:40:15,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:15,713 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 491 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 [2022-01-10 02:40:15,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 491 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2022-01-10 02:40:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3744. [2022-01-10 02:40:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3743 states have (on average 1.3363612075874967) internal successors, (5002), 3743 states have internal predecessors, (5002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5002 transitions. [2022-01-10 02:40:15,774 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5002 transitions. Word has length 254 [2022-01-10 02:40:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:15,774 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 5002 transitions. [2022-01-10 02:40:15,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5002 transitions. [2022-01-10 02:40:15,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-01-10 02:40:15,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:15,780 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:15,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 02:40:15,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:15,987 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1628541868, now seen corresponding path program 1 times [2022-01-10 02:40:15,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:15,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055164024] [2022-01-10 02:40:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:15,988 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:15,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:15,989 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:16,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 02:40:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:16,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:16,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-01-10 02:40:16,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:16,432 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055164024] [2022-01-10 02:40:16,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055164024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:16,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:16,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:16,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44803708] [2022-01-10 02:40:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:16,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:16,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:16,433 INFO L87 Difference]: Start difference. First operand 3744 states and 5002 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) [2022-01-10 02:40:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:16,572 INFO L93 Difference]: Finished difference Result 6452 states and 8765 transitions. [2022-01-10 02:40:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:16,572 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 291 [2022-01-10 02:40:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:16,576 INFO L225 Difference]: With dead ends: 6452 [2022-01-10 02:40:16,576 INFO L226 Difference]: Without dead ends: 1659 [2022-01-10 02:40:16,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:16,581 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:16,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 273 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-01-10 02:40:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1565. [2022-01-10 02:40:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.30306905370844) internal successors, (2038), 1564 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2038 transitions. [2022-01-10 02:40:16,607 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2038 transitions. Word has length 291 [2022-01-10 02:40:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:16,607 INFO L470 AbstractCegarLoop]: Abstraction has 1565 states and 2038 transitions. [2022-01-10 02:40:16,607 INFO L471 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) [2022-01-10 02:40:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2038 transitions. [2022-01-10 02:40:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-01-10 02:40:16,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:16,610 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:16,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:16,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:16,817 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1268706312, now seen corresponding path program 1 times [2022-01-10 02:40:16,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:16,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372601147] [2022-01-10 02:40:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:16,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:16,819 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:16,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 02:40:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:16,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:16,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2022-01-10 02:40:17,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:17,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:17,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372601147] [2022-01-10 02:40:17,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372601147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:17,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:17,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:17,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711634900] [2022-01-10 02:40:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:17,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:17,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:17,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:17,192 INFO L87 Difference]: Start difference. First operand 1565 states and 2038 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:17,303 INFO L93 Difference]: Finished difference Result 3309 states and 4377 transitions. [2022-01-10 02:40:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 300 [2022-01-10 02:40:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:17,307 INFO L225 Difference]: With dead ends: 3309 [2022-01-10 02:40:17,307 INFO L226 Difference]: Without dead ends: 1765 [2022-01-10 02:40:17,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:17,310 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:17,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 267 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-01-10 02:40:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1727. [2022-01-10 02:40:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.2920046349942063) internal successors, (2230), 1726 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2230 transitions. [2022-01-10 02:40:17,336 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2230 transitions. Word has length 300 [2022-01-10 02:40:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:17,336 INFO L470 AbstractCegarLoop]: Abstraction has 1727 states and 2230 transitions. [2022-01-10 02:40:17,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2230 transitions. [2022-01-10 02:40:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2022-01-10 02:40:17,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:17,340 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:17,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:17,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:17,564 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1338393859, now seen corresponding path program 1 times [2022-01-10 02:40:17,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:17,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088443334] [2022-01-10 02:40:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:17,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:17,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:17,565 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:17,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 02:40:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:17,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:17,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2022-01-10 02:40:17,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:17,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:17,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088443334] [2022-01-10 02:40:17,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088443334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:17,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:17,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:17,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940880995] [2022-01-10 02:40:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:17,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:17,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:17,937 INFO L87 Difference]: Start difference. First operand 1727 states and 2230 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:18,039 INFO L93 Difference]: Finished difference Result 3544 states and 4617 transitions. [2022-01-10 02:40:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 323 [2022-01-10 02:40:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:18,050 INFO L225 Difference]: With dead ends: 3544 [2022-01-10 02:40:18,050 INFO L226 Difference]: Without dead ends: 1838 [2022-01-10 02:40:18,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:18,053 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:18,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 267 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-10 02:40:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1600. [2022-01-10 02:40:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1599 states have (on average 1.2714196372732958) internal successors, (2033), 1599 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2033 transitions. [2022-01-10 02:40:18,076 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2033 transitions. Word has length 323 [2022-01-10 02:40:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:18,077 INFO L470 AbstractCegarLoop]: Abstraction has 1600 states and 2033 transitions. [2022-01-10 02:40:18,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2033 transitions. [2022-01-10 02:40:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-01-10 02:40:18,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:18,081 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:18,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:18,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:18,292 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1263289202, now seen corresponding path program 1 times [2022-01-10 02:40:18,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:18,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972651089] [2022-01-10 02:40:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:18,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:18,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:18,294 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:18,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 02:40:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:18,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:18,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 695 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2022-01-10 02:40:18,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:18,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:18,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972651089] [2022-01-10 02:40:18,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972651089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:18,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:18,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:18,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857895385] [2022-01-10 02:40:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:18,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:18,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:18,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:18,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:18,746 INFO L87 Difference]: Start difference. First operand 1600 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:18,780 INFO L93 Difference]: Finished difference Result 4614 states and 5827 transitions. [2022-01-10 02:40:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:18,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 355 [2022-01-10 02:40:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:18,787 INFO L225 Difference]: With dead ends: 4614 [2022-01-10 02:40:18,787 INFO L226 Difference]: Without dead ends: 3103 [2022-01-10 02:40:18,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:18,789 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:18,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 474 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2022-01-10 02:40:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3011. [2022-01-10 02:40:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3011 states, 3010 states have (on average 1.2674418604651163) internal successors, (3815), 3010 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 3011 states and 3815 transitions. [2022-01-10 02:40:18,836 INFO L78 Accepts]: Start accepts. Automaton has 3011 states and 3815 transitions. Word has length 355 [2022-01-10 02:40:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:18,837 INFO L470 AbstractCegarLoop]: Abstraction has 3011 states and 3815 transitions. [2022-01-10 02:40:18,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3815 transitions. [2022-01-10 02:40:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2022-01-10 02:40:18,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:18,842 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:18,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:19,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,049 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1411878677, now seen corresponding path program 1 times [2022-01-10 02:40:19,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:19,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252013325] [2022-01-10 02:40:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:19,050 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:19,053 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:19,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 02:40:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:19,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:19,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 852 proven. 26 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2022-01-10 02:40:19,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1310 backedges. 852 proven. 26 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2022-01-10 02:40:19,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:19,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252013325] [2022-01-10 02:40:19,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252013325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:19,890 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:19,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-01-10 02:40:19,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106036958] [2022-01-10 02:40:19,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:19,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:19,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:19,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:19,891 INFO L87 Difference]: Start difference. First operand 3011 states and 3815 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:20,113 INFO L93 Difference]: Finished difference Result 9171 states and 11686 transitions. [2022-01-10 02:40:20,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:20,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 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 356 [2022-01-10 02:40:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:20,132 INFO L225 Difference]: With dead ends: 9171 [2022-01-10 02:40:20,132 INFO L226 Difference]: Without dead ends: 6249 [2022-01-10 02:40:20,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:20,136 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 145 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:20,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 653 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:40:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6249 states. [2022-01-10 02:40:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6249 to 4059. [2022-01-10 02:40:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4058 states have (on average 1.291522917693445) internal successors, (5241), 4058 states have internal predecessors, (5241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 5241 transitions. [2022-01-10 02:40:20,236 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 5241 transitions. Word has length 356 [2022-01-10 02:40:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:20,237 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 5241 transitions. [2022-01-10 02:40:20,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 5241 transitions. [2022-01-10 02:40:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2022-01-10 02:40:20,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:20,243 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:20,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:20,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:20,464 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 258910961, now seen corresponding path program 1 times [2022-01-10 02:40:20,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:20,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611437402] [2022-01-10 02:40:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:20,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:20,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:20,466 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:20,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 02:40:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:20,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:20,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 893 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2022-01-10 02:40:20,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:20,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:20,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611437402] [2022-01-10 02:40:20,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611437402] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:20,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:20,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:20,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885655922] [2022-01-10 02:40:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:20,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:20,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:20,901 INFO L87 Difference]: Start difference. First operand 4059 states and 5241 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:21,024 INFO L93 Difference]: Finished difference Result 8488 states and 11022 transitions. [2022-01-10 02:40:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 386 [2022-01-10 02:40:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:21,033 INFO L225 Difference]: With dead ends: 8488 [2022-01-10 02:40:21,033 INFO L226 Difference]: Without dead ends: 4450 [2022-01-10 02:40:21,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:21,038 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:21,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4450 states. [2022-01-10 02:40:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4450 to 4399. [2022-01-10 02:40:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4399 states, 4398 states have (on average 1.28831286948613) internal successors, (5666), 4398 states have internal predecessors, (5666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4399 states to 4399 states and 5666 transitions. [2022-01-10 02:40:21,143 INFO L78 Accepts]: Start accepts. Automaton has 4399 states and 5666 transitions. Word has length 386 [2022-01-10 02:40:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:21,143 INFO L470 AbstractCegarLoop]: Abstraction has 4399 states and 5666 transitions. [2022-01-10 02:40:21,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4399 states and 5666 transitions. [2022-01-10 02:40:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2022-01-10 02:40:21,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:21,149 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 02:40:21,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:21,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:21,357 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -284409887, now seen corresponding path program 1 times [2022-01-10 02:40:21,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:21,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098236934] [2022-01-10 02:40:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:21,358 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:21,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:21,359 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:21,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 02:40:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:21,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:21,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-01-10 02:40:21,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:21,808 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:21,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098236934] [2022-01-10 02:40:21,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098236934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:21,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:21,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:21,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132892142] [2022-01-10 02:40:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:21,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:21,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:21,809 INFO L87 Difference]: Start difference. First operand 4399 states and 5666 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:21,940 INFO L93 Difference]: Finished difference Result 9389 states and 12310 transitions. [2022-01-10 02:40:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 387 [2022-01-10 02:40:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:21,951 INFO L225 Difference]: With dead ends: 9389 [2022-01-10 02:40:21,952 INFO L226 Difference]: Without dead ends: 5011 [2022-01-10 02:40:21,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:21,957 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:21,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 267 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2022-01-10 02:40:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4977. [2022-01-10 02:40:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4977 states, 4976 states have (on average 1.2719051446945338) internal successors, (6329), 4976 states have internal predecessors, (6329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6329 transitions. [2022-01-10 02:40:22,048 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6329 transitions. Word has length 387 [2022-01-10 02:40:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:22,048 INFO L470 AbstractCegarLoop]: Abstraction has 4977 states and 6329 transitions. [2022-01-10 02:40:22,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6329 transitions. [2022-01-10 02:40:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-01-10 02:40:22,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:22,055 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 11, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:22,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-01-10 02:40:22,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:22,261 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1793972455, now seen corresponding path program 1 times [2022-01-10 02:40:22,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:22,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439924844] [2022-01-10 02:40:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:22,263 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:22,263 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:22,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 02:40:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:22,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:22,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 957 proven. 206 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2022-01-10 02:40:23,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 1052 proven. 111 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2022-01-10 02:40:24,716 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:24,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439924844] [2022-01-10 02:40:24,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439924844] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:24,716 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:24,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-01-10 02:40:24,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88711107] [2022-01-10 02:40:24,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:24,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:40:24,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:40:24,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:24,718 INFO L87 Difference]: Start difference. First operand 4977 states and 6329 transitions. Second operand has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:25,805 INFO L93 Difference]: Finished difference Result 14700 states and 18960 transitions. [2022-01-10 02:40:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:40:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 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 404 [2022-01-10 02:40:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:25,818 INFO L225 Difference]: With dead ends: 14700 [2022-01-10 02:40:25,818 INFO L226 Difference]: Without dead ends: 9736 [2022-01-10 02:40:25,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 801 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:25,822 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 461 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:25,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 708 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 348 Invalid, 0 Unknown, 195 Unchecked, 0.8s Time] [2022-01-10 02:40:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9736 states. [2022-01-10 02:40:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9736 to 8617. [2022-01-10 02:40:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8617 states, 8616 states have (on average 1.2697307335190344) internal successors, (10940), 8616 states have internal predecessors, (10940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8617 states to 8617 states and 10940 transitions. [2022-01-10 02:40:25,998 INFO L78 Accepts]: Start accepts. Automaton has 8617 states and 10940 transitions. Word has length 404 [2022-01-10 02:40:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:25,998 INFO L470 AbstractCegarLoop]: Abstraction has 8617 states and 10940 transitions. [2022-01-10 02:40:25,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.428571428571427) internal successors, (206), 7 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 8617 states and 10940 transitions. [2022-01-10 02:40:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2022-01-10 02:40:26,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:26,009 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2022-01-10 02:40:26,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:26,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:26,216 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -944746421, now seen corresponding path program 1 times [2022-01-10 02:40:26,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:26,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915091289] [2022-01-10 02:40:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:26,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:26,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:26,218 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:26,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 02:40:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:26,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:26,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1873 backedges. 1113 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-01-10 02:40:26,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:26,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:26,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915091289] [2022-01-10 02:40:26,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915091289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:26,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:26,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:26,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007061083] [2022-01-10 02:40:26,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:26,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:26,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:26,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:26,770 INFO L87 Difference]: Start difference. First operand 8617 states and 10940 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:26,983 INFO L93 Difference]: Finished difference Result 17437 states and 22309 transitions. [2022-01-10 02:40:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 418 [2022-01-10 02:40:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:26,996 INFO L225 Difference]: With dead ends: 17437 [2022-01-10 02:40:26,996 INFO L226 Difference]: Without dead ends: 8841 [2022-01-10 02:40:27,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:27,003 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:27,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 267 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2022-01-10 02:40:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 7849. [2022-01-10 02:40:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7849 states, 7848 states have (on average 1.2398063200815495) internal successors, (9730), 7848 states have internal predecessors, (9730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7849 states to 7849 states and 9730 transitions. [2022-01-10 02:40:27,158 INFO L78 Accepts]: Start accepts. Automaton has 7849 states and 9730 transitions. Word has length 418 [2022-01-10 02:40:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:27,158 INFO L470 AbstractCegarLoop]: Abstraction has 7849 states and 9730 transitions. [2022-01-10 02:40:27,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7849 states and 9730 transitions. [2022-01-10 02:40:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-01-10 02:40:27,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:27,165 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 12, 11, 10, 10, 9, 9, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-01-10 02:40:27,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:27,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:27,372 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:27,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:27,373 INFO L85 PathProgramCache]: Analyzing trace with hash -932113036, now seen corresponding path program 2 times [2022-01-10 02:40:27,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:27,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343273272] [2022-01-10 02:40:27,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:40:27,373 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:27,374 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:27,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 02:40:27,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:40:27,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:40:27,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:40:27,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2073 backedges. 1100 proven. 312 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-01-10 02:40:28,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2073 backedges. 1243 proven. 169 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2022-01-10 02:40:30,153 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:30,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343273272] [2022-01-10 02:40:30,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343273272] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:30,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:30,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-01-10 02:40:30,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616084366] [2022-01-10 02:40:30,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:30,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:40:30,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:40:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:40:30,155 INFO L87 Difference]: Start difference. First operand 7849 states and 9730 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:31,106 INFO L93 Difference]: Finished difference Result 20891 states and 25955 transitions. [2022-01-10 02:40:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:40:31,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 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 432 [2022-01-10 02:40:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:31,127 INFO L225 Difference]: With dead ends: 20891 [2022-01-10 02:40:31,127 INFO L226 Difference]: Without dead ends: 13063 [2022-01-10 02:40:31,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 857 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:40:31,137 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 328 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:31,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 723 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 326 Invalid, 0 Unknown, 199 Unchecked, 0.7s Time] [2022-01-10 02:40:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2022-01-10 02:40:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 12024. [2022-01-10 02:40:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12024 states, 12023 states have (on average 1.234300923230475) internal successors, (14840), 12023 states have internal predecessors, (14840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12024 states to 12024 states and 14840 transitions. [2022-01-10 02:40:31,376 INFO L78 Accepts]: Start accepts. Automaton has 12024 states and 14840 transitions. Word has length 432 [2022-01-10 02:40:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:31,376 INFO L470 AbstractCegarLoop]: Abstraction has 12024 states and 14840 transitions. [2022-01-10 02:40:31,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 12024 states and 14840 transitions. [2022-01-10 02:40:31,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2022-01-10 02:40:31,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:31,414 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 10, 10, 9, 9, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-01-10 02:40:31,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:31,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,623 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash -708820783, now seen corresponding path program 1 times [2022-01-10 02:40:31,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:31,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217297400] [2022-01-10 02:40:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:31,624 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:31,625 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:31,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 02:40:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:31,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:31,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 724 proven. 12 refuted. 0 times theorem prover too weak. 1497 trivial. 0 not checked. [2022-01-10 02:40:32,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 724 proven. 12 refuted. 0 times theorem prover too weak. 1497 trivial. 0 not checked. [2022-01-10 02:40:32,705 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:32,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217297400] [2022-01-10 02:40:32,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217297400] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:32,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:32,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-01-10 02:40:32,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674901607] [2022-01-10 02:40:32,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:32,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:32,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:32,706 INFO L87 Difference]: Start difference. First operand 12024 states and 14840 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:32,978 INFO L93 Difference]: Finished difference Result 24896 states and 30728 transitions. [2022-01-10 02:40:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:40:32,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 445 [2022-01-10 02:40:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:32,992 INFO L225 Difference]: With dead ends: 24896 [2022-01-10 02:40:32,992 INFO L226 Difference]: Without dead ends: 11984 [2022-01-10 02:40:33,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:40:33,002 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 22 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:33,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 484 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11984 states. [2022-01-10 02:40:33,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11984 to 11984. [2022-01-10 02:40:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11984 states, 11983 states have (on average 1.2301593924726697) internal successors, (14741), 11983 states have internal predecessors, (14741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11984 states to 11984 states and 14741 transitions. [2022-01-10 02:40:33,245 INFO L78 Accepts]: Start accepts. Automaton has 11984 states and 14741 transitions. Word has length 445 [2022-01-10 02:40:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:33,245 INFO L470 AbstractCegarLoop]: Abstraction has 11984 states and 14741 transitions. [2022-01-10 02:40:33,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 11984 states and 14741 transitions. [2022-01-10 02:40:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2022-01-10 02:40:33,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:33,255 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:40:33,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:33,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:33,463 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:33,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2062023293, now seen corresponding path program 1 times [2022-01-10 02:40:33,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:33,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888076430] [2022-01-10 02:40:33,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:33,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:33,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:33,465 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:40:33,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 02:40:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:33,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:33,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 1002 proven. 17 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2022-01-10 02:40:34,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 1002 proven. 17 refuted. 0 times theorem prover too weak. 1442 trivial. 0 not checked. [2022-01-10 02:40:34,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:34,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888076430] [2022-01-10 02:40:34,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888076430] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:34,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:34,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:40:34,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586827500] [2022-01-10 02:40:34,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:34,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:34,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:34,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:34,548 INFO L87 Difference]: Start difference. First operand 11984 states and 14741 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:34,963 INFO L93 Difference]: Finished difference Result 16930 states and 20762 transitions. [2022-01-10 02:40:34,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:40:34,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 475 [2022-01-10 02:40:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:34,964 INFO L225 Difference]: With dead ends: 16930 [2022-01-10 02:40:34,964 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:40:34,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:40:34,972 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 280 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:34,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 653 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:40:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:40:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:40:34,973 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) [2022-01-10 02:40:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:40:34,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 475 [2022-01-10 02:40:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:34,973 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:40:34,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:40:34,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:40:34,975 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:40:34,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:35,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:40:35,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:40:53,486 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-01-10 02:40:53,486 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 608) no Hoare annotation was computed. [2022-01-10 02:40:53,486 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 619) no Hoare annotation was computed. [2022-01-10 02:40:53,486 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 630) no Hoare annotation was computed. [2022-01-10 02:40:53,487 INFO L861 garLoopResultBuilder]: At program point L697(lines 688 699) the Hoare annotation is: true [2022-01-10 02:40:53,487 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 398) no Hoare annotation was computed. [2022-01-10 02:40:53,487 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 338) no Hoare annotation was computed. [2022-01-10 02:40:53,487 INFO L858 garLoopResultBuilder]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2022-01-10 02:40:53,487 INFO L854 garLoopResultBuilder]: At program point L202(lines 198 609) the Hoare annotation is: (let ((.cse6 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (.cse1 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= (_ bv8448 32) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 (= .cse6 (_ bv8496 32)) .cse1 .cse2 .cse4) (and (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) .cse1 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse1 .cse2 (or .cse5 .cse3))))) [2022-01-10 02:40:53,487 INFO L854 garLoopResultBuilder]: At program point L169(lines 165 620) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,487 INFO L854 garLoopResultBuilder]: At program point L136(lines 135 630) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32))) .cse0) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse0) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0))) [2022-01-10 02:40:53,487 INFO L858 garLoopResultBuilder]: For program point L533(lines 533 538) no Hoare annotation was computed. [2022-01-10 02:40:53,487 INFO L854 garLoopResultBuilder]: At program point L600(lines 111 668) the Hoare annotation is: (let ((.cse26 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse19 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))) (.cse1 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse20 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse23 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32)))) (.cse14 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8482 32))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (.cse24 (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32))) (.cse12 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= .cse26 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse9 (= .cse26 (_ bv8496 32))) (.cse21 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse13 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse7 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse25 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (= (_ bv8448 32) .cse26))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse5 .cse8) (and .cse6 .cse9 .cse1 .cse8) (and .cse10 .cse11 .cse12) (and .cse0 .cse13) (and .cse6 .cse14 .cse5) (and .cse6 .cse9 .cse15 .cse3 .cse8) (and .cse16 (= (_ bv8482 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse6 .cse17 .cse18 .cse5) (and .cse0 .cse19) (and .cse6 .cse20 .cse5) (and .cse0 .cse21) (and .cse0 .cse4 .cse12) (and .cse9 .cse2 .cse13 .cse8) (and .cse6 .cse9 .cse14) (and .cse6 .cse9 .cse17 .cse18) (and .cse6 .cse15 .cse22 .cse5 .cse8) (and .cse6 .cse9 .cse15 .cse23 .cse8) (and .cse0 .cse23) (and .cse0 .cse20) (and .cse6 .cse9 .cse17 .cse12) (and .cse6 .cse9 .cse7 .cse8) (and .cse6 .cse24) (and .cse6 .cse1 .cse5 .cse8) (and .cse6 .cse9 .cse19 .cse17) (and .cse6 .cse15 .cse19 .cse5 .cse8) (and .cse6 .cse9 .cse25) (and .cse0 .cse22) (and .cse10 .cse11 .cse1) (and .cse6 .cse9 .cse20) (and .cse6 .cse17 .cse23 .cse5) (and .cse15 .cse24) (and .cse0 .cse14) (and .cse16 .cse12) (and .cse6 .cse3 .cse17 .cse5) (and .cse2 .cse13 .cse5 .cse8) (and .cse0 .cse24) (and .cse6 .cse21 .cse5) (and .cse0 .cse5) (and .cse0 .cse17 .cse12) (and .cse9 .cse2 .cse4 .cse12) (and .cse0 .cse3) (and .cse0 .cse17 .cse18) (and .cse6 .cse9 .cse22 .cse17) (and .cse6 .cse9 .cse21) (and .cse0 .cse7) (and .cse10 .cse2 .cse13) (and .cse10 .cse6 .cse7) (and .cse6 .cse25 .cse5)))) [2022-01-10 02:40:53,487 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-01-10 02:40:53,487 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 307) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L303-2(lines 221 599) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 607) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 618) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 629) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 397) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L370-1(lines 370 397) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 394) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L861 garLoopResultBuilder]: At program point L669(lines 110 670) the Hoare annotation is: true [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 606) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L174(lines 174 617) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 628) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L406(lines 406 437) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L854 garLoopResultBuilder]: At program point L208(lines 204 607) the Hoare annotation is: (let ((.cse6 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (.cse2 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= (_ bv8448 32) .cse6)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 (= .cse6 (_ bv8496 32)) .cse1 .cse2 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse1 .cse2 (or .cse5 .cse3)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) .cse0 .cse1)))) [2022-01-10 02:40:53,488 INFO L854 garLoopResultBuilder]: At program point L175(lines 171 618) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L241-2(lines 221 599) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 666) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L407(lines 407 413) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L374(lines 374 393) no Hoare annotation was computed. [2022-01-10 02:40:53,488 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 663) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 511) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L573-2(lines 573 577) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 221 599) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L375-2(lines 374 391) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 605) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 616) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 627) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L854 garLoopResultBuilder]: At program point L111-2(lines 111 668) the Hoare annotation is: (let ((.cse26 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse19 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))) (.cse1 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse20 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse23 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32)))) (.cse14 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8482 32))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (.cse24 (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32))) (.cse12 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= .cse26 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse9 (= .cse26 (_ bv8496 32))) (.cse21 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse13 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse7 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse25 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (= (_ bv8448 32) .cse26))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse5 .cse8) (and .cse6 .cse9 .cse1 .cse8) (and .cse10 .cse11 .cse12) (and .cse0 .cse13) (and .cse6 .cse14 .cse5) (and .cse6 .cse9 .cse15 .cse3 .cse8) (and .cse16 (= (_ bv8482 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse6 .cse17 .cse18 .cse5) (and .cse0 .cse19) (and .cse6 .cse20 .cse5) (and .cse0 .cse21) (and .cse0 .cse4 .cse12) (and .cse9 .cse2 .cse13 .cse8) (and .cse6 .cse9 .cse14) (and .cse6 .cse9 .cse17 .cse18) (and .cse6 .cse15 .cse22 .cse5 .cse8) (and .cse6 .cse9 .cse15 .cse23 .cse8) (and .cse0 .cse23) (and .cse0 .cse20) (and .cse6 .cse9 .cse17 .cse12) (and .cse6 .cse9 .cse7 .cse8) (and .cse6 .cse24) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8464 32)) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))) (and .cse6 .cse1 .cse5 .cse8) (and .cse6 .cse9 .cse19 .cse17) (and .cse6 .cse15 .cse19 .cse5 .cse8) (and .cse6 .cse9 .cse25) (and .cse0 .cse22) (and .cse10 .cse11 .cse1) (and .cse6 .cse9 .cse20) (and .cse6 .cse17 .cse23 .cse5) (and .cse15 .cse24) (and .cse0 .cse14) (and .cse16 .cse12) (and .cse6 .cse3 .cse17 .cse5) (and .cse2 .cse13 .cse5 .cse8) (and .cse0 .cse24) (and .cse6 .cse21 .cse5) (and .cse0 .cse5) (and .cse0 .cse17 .cse12) (and .cse9 .cse2 .cse4 .cse12) (and .cse0 .cse3) (and .cse0 .cse17 .cse18) (and .cse6 .cse9 .cse22 .cse17) (and .cse6 .cse9 .cse21) (and .cse0 .cse7) (and .cse10 .cse2 .cse13) (and .cse10 .cse6 .cse7) (and .cse6 .cse25 .cse5)))) [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L673(lines 673 677) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L640(lines 640 649) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L673-2(lines 673 677) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L640-2(lines 639 661) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L475(lines 475 479) no Hoare annotation was computed. [2022-01-10 02:40:53,489 INFO L858 garLoopResultBuilder]: For program point L343-1(lines 343 352) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L854 garLoopResultBuilder]: At program point L178(lines 177 616) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse3 (= (_ bv8448 32) .cse2)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse8 (= .cse2 (_ bv8496 32))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32))) (.cse0 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)) .cse0) (and .cse1 (= .cse2 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse3) (and .cse1 .cse4 .cse0) (and .cse5 .cse6 .cse0 .cse3) (and .cse7 .cse4 .cse0 .cse3) (and .cse5 .cse8 .cse6 .cse0) (and (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8482 32)) .cse0) (and .cse1 .cse6 .cse0) (and .cse8 .cse7 .cse4 .cse0)))) [2022-01-10 02:40:53,490 INFO L854 garLoopResultBuilder]: At program point L145(lines 138 629) the Hoare annotation is: (let ((.cse1 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse5 (= (_ bv8448 32) .cse1))) (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse2 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (or (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse5))) (or (and .cse0 (= .cse1 (_ bv8496 32)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32))) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)) .cse2 .cse3 .cse5) (and .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))))))) [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 604) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 615) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 626) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 637) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L854 garLoopResultBuilder]: At program point L214(lines 210 605) the Hoare annotation is: (let ((.cse1 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= (_ bv8448 32) .cse1)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= .cse1 (_ bv8496 32)) .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse6 .cse5) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse6)) (and (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) .cse2 .cse3)))) [2022-01-10 02:40:53,490 INFO L861 garLoopResultBuilder]: At program point L115(lines 114 637) the Hoare annotation is: true [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 491) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L854 garLoopResultBuilder]: At program point L381(lines 364 399) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 603) no Hoare annotation was computed. [2022-01-10 02:40:53,490 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 614) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 625) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 636) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L854 garLoopResultBuilder]: At program point L415(lines 406 437) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,491 INFO L861 garLoopResultBuilder]: At program point L217(lines 216 603) the Hoare annotation is: true [2022-01-10 02:40:53,491 INFO L854 garLoopResultBuilder]: At program point L184(lines 180 615) the Hoare annotation is: (let ((.cse1 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse7 (= (_ bv8448 32) .cse1)) (.cse3 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse2 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= .cse1 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (and .cse3 .cse4 (= .cse1 (_ bv8496 32)) .cse5 .cse2 .cse6) (and .cse4 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse3 .cse0 .cse5 .cse2 .cse6)))) [2022-01-10 02:40:53,491 INFO L854 garLoopResultBuilder]: At program point L151(lines 147 626) the Hoare annotation is: (let ((.cse3 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (= .cse3 (_ bv8496 32))) (.cse1 (= .cse3 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32))) .cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (and .cse0 .cse2 .cse1) (and .cse2 (= (_ bv8448 32) .cse3))))) [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 613) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 624) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 635) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L583(lines 583 593) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 488) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L861 garLoopResultBuilder]: At program point L220(lines 219 602) the Hoare annotation is: true [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2022-01-10 02:40:53,491 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L320(lines 320 328) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L861 garLoopResultBuilder]: At program point L684(lines 76 686) the Hoare annotation is: true [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L651(lines 651 657) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L552(lines 552 557) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 612) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 623) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 634) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L861 garLoopResultBuilder]: At program point L685(lines 19 687) the Hoare annotation is: true [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L854 garLoopResultBuilder]: At program point L190(lines 186 613) the Hoare annotation is: (let ((.cse5 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= (_ bv8448 32) .cse5))) (or (and .cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32))) .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (and .cse4 .cse0 (= .cse5 (_ bv8496 32)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)) .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse1 .cse2 (or .cse4 .cse3))))) [2022-01-10 02:40:53,492 INFO L854 garLoopResultBuilder]: At program point L157(lines 153 624) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L323-2(lines 221 599) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L861 garLoopResultBuilder]: At program point L224(lines 117 636) the Hoare annotation is: true [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 611) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 622) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 633) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-01-10 02:40:53,492 INFO L858 garLoopResultBuilder]: For program point L523-2(lines 523 527) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L457-1(lines 457 469) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L854 garLoopResultBuilder]: At program point L425(lines 416 436) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L359-2(lines 221 599) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L95-1(lines 76 686) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 610) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 621) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 632) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 465) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L854 garLoopResultBuilder]: At program point L196(lines 192 611) the Hoare annotation is: (let ((.cse5 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8497 32)))) (.cse1 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= (_ bv8448 32) .cse5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= .cse5 (_ bv8496 32)) (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse1 .cse2 (or (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse3))))) [2022-01-10 02:40:53,493 INFO L854 garLoopResultBuilder]: At program point L163(lines 159 622) the Hoare annotation is: (let ((.cse2 (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse0 (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= (_ bv8497 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= (_ bv8448 32) .cse2))) (or (and .cse0 .cse1 (= .cse2 (_ bv8496 32)) .cse3 .cse4) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse3 .cse4 (or .cse0 .cse5)) (and .cse1 .cse3 .cse4 .cse5)))) [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L229-2(lines 221 599) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:40:53,493 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 680) no Hoare annotation was computed. [2022-01-10 02:40:53,494 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 609) no Hoare annotation was computed. [2022-01-10 02:40:53,494 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 620) no Hoare annotation was computed. [2022-01-10 02:40:53,494 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 631) no Hoare annotation was computed. [2022-01-10 02:40:53,494 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-01-10 02:40:53,494 INFO L858 garLoopResultBuilder]: For program point L496(lines 496 500) no Hoare annotation was computed. [2022-01-10 02:40:53,494 INFO L854 garLoopResultBuilder]: At program point L133(lines 129 632) the Hoare annotation is: (let ((.cse0 (not (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (or (not (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= (_ bv8448 32) (bvadd (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (bvmul (_ bv2 32) |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse0 .cse1) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) .cse0 .cse1) (and (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8496 32))) .cse0 .cse1))) [2022-01-10 02:40:53,494 INFO L854 garLoopResultBuilder]: At program point L563(lines 76 686) the Hoare annotation is: false [2022-01-10 02:40:53,494 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 280) no Hoare annotation was computed. [2022-01-10 02:40:53,498 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:53,499 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:40:53,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:40:53 BoogieIcfgContainer [2022-01-10 02:40:53,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:40:53,556 INFO L158 Benchmark]: Toolchain (without parser) took 46413.90ms. Allocated memory was 188.7MB in the beginning and 1.1GB in the end (delta: 893.4MB). Free memory was 133.4MB in the beginning and 626.3MB in the end (delta: -492.9MB). Peak memory consumption was 560.8MB. Max. memory is 8.0GB. [2022-01-10 02:40:53,556 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:40:53,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.76ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 133.3MB in the beginning and 197.2MB in the end (delta: -63.8MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-01-10 02:40:53,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 228.6MB. Free memory was 196.6MB in the beginning and 194.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:53,556 INFO L158 Benchmark]: Boogie Preprocessor took 31.09ms. Allocated memory is still 228.6MB. Free memory was 194.0MB in the beginning and 191.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:53,557 INFO L158 Benchmark]: RCFGBuilder took 623.46ms. Allocated memory is still 228.6MB. Free memory was 191.9MB in the beginning and 164.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-10 02:40:53,557 INFO L158 Benchmark]: TraceAbstraction took 45397.92ms. Allocated memory was 228.6MB in the beginning and 1.1GB in the end (delta: 853.5MB). Free memory was 164.1MB in the beginning and 626.3MB in the end (delta: -462.2MB). Peak memory consumption was 551.8MB. Max. memory is 8.0GB. [2022-01-10 02:40:53,557 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.76ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 133.3MB in the beginning and 197.2MB in the end (delta: -63.8MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 228.6MB. Free memory was 196.6MB in the beginning and 194.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.09ms. Allocated memory is still 228.6MB. Free memory was 194.0MB in the beginning and 191.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 623.46ms. Allocated memory is still 228.6MB. Free memory was 191.9MB in the beginning and 164.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 45397.92ms. Allocated memory was 228.6MB in the beginning and 1.1GB in the end (delta: 853.5MB). Free memory was 164.1MB in the beginning and 626.3MB in the end (delta: -462.2MB). Peak memory consumption was 551.8MB. Max. memory is 8.0GB. * 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: 680]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.3s, OverallIterations: 24, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2513 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2513 mSDsluCounter, 10088 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 394 IncrementalHoareTripleChecker+Unchecked, 4584 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3731 IncrementalHoareTripleChecker+Invalid, 4611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 5504 mSDtfsCounter, 3731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8515 GetRequests, 8460 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12024occurred in iteration=22, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 6610 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 683 NumberOfFragments, 2959 HoareAnnotationTreeSize, 29 FomulaSimplifications, 16926 FormulaSimplificationTreeSizeReduction, 3.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 59119 FormulaSimplificationTreeSizeReductionInter, 14.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 6156 NumberOfCodeBlocks, 6156 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8491 ConstructedInterpolants, 42 QuantifiedInterpolants, 17702 SizeOfPredicates, 15 NumberOfNonLiveVariables, 7190 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 30670/31610 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: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((blastFlag == 1bv32 && 8640bv32 == s__state) || (((blastFlag == 3bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 2bv32 && 8656bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8640bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && 8672bv32 == s__state)) || ((blastFlag == 2bv32 && 8544bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(s__s3__tmp__next_state___0 == 8496bv32)) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (s__s3__tmp__next_state___0 == 8482bv32 && 8482bv32 == s__state)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (blastFlag == 1bv32 && 8592bv32 == s__state)) || ((blastFlag == 2bv32 && 8560bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (blastFlag == 1bv32 && 8528bv32 == s__state)) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (((~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32 && blastFlag == 3bv32) && 8672bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8544bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8496bv32)) && 8608bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(s__s3__tmp__next_state___0 == 8496bv32)) && s__state == 8466bv32) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (blastFlag == 1bv32 && s__state == 8466bv32)) || (blastFlag == 1bv32 && 8560bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8656bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (blastFlag == 2bv32 && 3bv32 == s__state)) || (((blastFlag == 2bv32 && 8640bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8496bv32)) && 8592bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8512bv32 == s__state)) || (blastFlag == 1bv32 && 8608bv32 == s__state)) || ((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8560bv32 == s__state)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__state == 8466bv32) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (!(s__s3__tmp__next_state___0 == 8496bv32) && 3bv32 == s__state)) || (blastFlag == 1bv32 && 8544bv32 == s__state)) || (s__s3__tmp__next_state___0 == 8482bv32 && 8448bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 3bv32 && 8672bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (blastFlag == 1bv32 && 3bv32 == s__state)) || ((blastFlag == 2bv32 && 8528bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (blastFlag == 1bv32 && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || (((~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32 && blastFlag == 3bv32) && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state)) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8528bv32 == s__state)) || (blastFlag == 1bv32 && 8656bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && 8672bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8656bv32 == s__state)) || ((blastFlag == 2bv32 && 8512bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32)) || (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && !(8496bv32 == s__state)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((blastFlag == 2bv32 && !(8496bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || ((!(s__s3__tmp__next_state___0 == 8496bv32) && !(8496bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((!(s__s3__tmp__next_state___0 == 8496bv32) && !(8496bv32 == s__state)) || (blastFlag == 1bv32 && !(8496bv32 == s__state))) || (blastFlag == 2bv32 && !(8496bv32 == s__state)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(s__s3__tmp__next_state___0 == 8496bv32)) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32)) || ((~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32 && blastFlag == 1bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state)) || (blastFlag == 1bv32 && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((blastFlag == 1bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && !(8496bv32 == s__state)) || (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state))) || ((((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((((!(8448bv32 == s__state) && blastFlag == 1bv32) && s__s3__tmp__next_state___0 == 8576bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32)) || (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((!(s__hit == 0bv32) && !(8496bv32 == s__state)) && s__s3__tmp__next_state___0 == 8640bv32)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((!(8448bv32 == s__state) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && blastFlag == 3bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8497bv32)) || ((((blastFlag == 3bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && !(8496bv32 == s__state)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(s__s3__tmp__next_state___0 == 8496bv32)) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) && !(s__s3__tmp__next_state___0 == 8497bv32)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || ((((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((!(8496bv32 == s__state) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) && blastFlag == 0bv32) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8496bv32)) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32)) || (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state))) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state) || ((blastFlag == 1bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || (s__s3__tmp__next_state___0 == 8482bv32 && 8448bv32 == s__state)) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || (((~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32 && blastFlag == 3bv32) && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((blastFlag == 1bv32 && 8640bv32 == s__state) || (((blastFlag == 3bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 2bv32 && 8656bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8640bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && 8672bv32 == s__state)) || ((blastFlag == 2bv32 && 8544bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(s__s3__tmp__next_state___0 == 8496bv32)) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (s__s3__tmp__next_state___0 == 8482bv32 && 8482bv32 == s__state)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (blastFlag == 1bv32 && 8592bv32 == s__state)) || ((blastFlag == 2bv32 && 8560bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (blastFlag == 1bv32 && 8528bv32 == s__state)) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (((~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32 && blastFlag == 3bv32) && 8672bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8544bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8496bv32)) && 8608bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(s__s3__tmp__next_state___0 == 8496bv32)) && s__state == 8466bv32) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (blastFlag == 1bv32 && s__state == 8466bv32)) || (blastFlag == 1bv32 && 8560bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8656bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (blastFlag == 2bv32 && 3bv32 == s__state)) || (s__state == 8464bv32 && blastFlag == 0bv32)) || (((blastFlag == 2bv32 && 8640bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((((blastFlag == 2bv32 && !(s__s3__tmp__next_state___0 == 8496bv32)) && 8592bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8512bv32 == s__state)) || (blastFlag == 1bv32 && 8608bv32 == s__state)) || ((!(s__hit == 0bv32) && s__s3__tmp__next_state___0 == 8640bv32) && 8640bv32 == s__state)) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8560bv32 == s__state)) || (((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && s__state == 8466bv32) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (!(s__s3__tmp__next_state___0 == 8496bv32) && 3bv32 == s__state)) || (blastFlag == 1bv32 && 8544bv32 == s__state)) || (s__s3__tmp__next_state___0 == 8482bv32 && 8448bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state) && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (((blastFlag == 3bv32 && 8672bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (blastFlag == 1bv32 && 3bv32 == s__state)) || ((blastFlag == 2bv32 && 8528bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || (blastFlag == 1bv32 && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || (((~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32 && blastFlag == 3bv32) && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == s__state)) || ((blastFlag == 1bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || (((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8528bv32 == s__state)) || (blastFlag == 1bv32 && 8656bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && 8672bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8656bv32 == s__state)) || ((blastFlag == 2bv32 && 8512bv32 == s__state) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) && !(s__s3__tmp__next_state___0 == 8497bv32)) || ((((blastFlag == 2bv32 && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && 8608bv32 == s__state) && !(8496bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8497bv32))) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)))) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((!(8448bv32 == s__state) && blastFlag == 2bv32) && ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y)) == 8496bv32) && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) || (((blastFlag == 1bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && (!(8448bv32 == s__state) || 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))))) || (((blastFlag == 2bv32 && !(8496bv32 == s__state)) && !(8497bv32 == s__state)) && 8448bv32 == ~bvadd16(~bvmul32(2bv32, ag_X), ~bvmul32(2bv32, ag_Y))) RESULT: Ultimate proved your program to be correct! [2022-01-10 02:40:53,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...