/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_3a.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:40:07,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:40:07,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:40:07,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:40:07,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:40:07,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:40:07,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:40:07,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:40:07,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:40:07,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:40:07,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:40:07,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:40:07,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:40:07,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:40:07,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:40:07,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:40:07,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:40:07,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:40:07,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:40:07,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:40:07,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:40:07,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:40:07,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:40:07,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:40:07,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:40:07,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:40:07,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:40:07,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:40:07,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:40:07,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:40:07,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:40:07,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:40:07,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:40:07,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:40:07,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:40:07,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:40:07,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:40:07,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:40:07,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:40:07,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:40:07,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:40:07,089 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:07,112 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:40:07,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:40:07,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:40:07,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:40:07,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:40:07,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:40:07,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:40:07,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:40:07,114 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:40:07,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:40:07,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:40:07,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:40:07,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:40:07,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:07,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:40:07,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:40:07,117 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:07,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:40:07,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:40:07,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:40:07,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:40:07,338 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:40:07,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_3a.BV.c.cil.c [2022-01-10 02:40:07,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07821a66e/ac9fe00d49df44f8b3ed897ae3f9fab2/FLAG06e653cc4 [2022-01-10 02:40:07,995 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:40:07,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3a.BV.c.cil.c [2022-01-10 02:40:08,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07821a66e/ac9fe00d49df44f8b3ed897ae3f9fab2/FLAG06e653cc4 [2022-01-10 02:40:08,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07821a66e/ac9fe00d49df44f8b3ed897ae3f9fab2 [2022-01-10 02:40:08,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:40:08,322 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:40:08,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:08,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:40:08,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:40:08,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:08" (1/1) ... [2022-01-10 02:40:08,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165ea233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:08, skipping insertion in model container [2022-01-10 02:40:08,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:40:08" (1/1) ... [2022-01-10 02:40:08,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:40:08,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:40:08,563 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_3a.BV.c.cil.c[44494,44507] [2022-01-10 02:40:08,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:08,574 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:40:08,621 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_3a.BV.c.cil.c[44494,44507] [2022-01-10 02:40:08,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:40:08,632 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:40:08,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:08 WrapperNode [2022-01-10 02:40:08,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:40:08,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:08,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:40:08,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:40:08,643 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:08" (1/1) ... [2022-01-10 02:40:08,650 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:08" (1/1) ... [2022-01-10 02:40:08,687 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 477 [2022-01-10 02:40:08,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:40:08,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:40:08,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:40:08,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:40:08,694 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:08" (1/1) ... [2022-01-10 02:40:08,694 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:08" (1/1) ... [2022-01-10 02:40:08,698 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:08" (1/1) ... [2022-01-10 02:40:08,699 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:08" (1/1) ... [2022-01-10 02:40:08,704 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:08" (1/1) ... [2022-01-10 02:40:08,709 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:08" (1/1) ... [2022-01-10 02:40:08,710 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:08" (1/1) ... [2022-01-10 02:40:08,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:40:08,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:40:08,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:40:08,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:40:08,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:08" (1/1) ... [2022-01-10 02:40:08,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:40:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:40:08,774 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:08,794 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:08,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:40:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:40:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:40:08,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:40:08,911 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:40:08,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:40:08,922 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 02:40:09,337 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 02:40:09,337 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 02:40:09,337 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:40:09,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:40:09,343 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 02:40:09,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:09 BoogieIcfgContainer [2022-01-10 02:40:09,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:40:09,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:40:09,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:40:09,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:40:09,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:40:08" (1/3) ... [2022-01-10 02:40:09,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26404c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:09, skipping insertion in model container [2022-01-10 02:40:09,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:40:08" (2/3) ... [2022-01-10 02:40:09,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26404c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:40:09, skipping insertion in model container [2022-01-10 02:40:09,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:40:09" (3/3) ... [2022-01-10 02:40:09,350 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2022-01-10 02:40:09,353 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:40:09,353 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:40:09,382 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:40:09,387 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:09,388 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:40:09,405 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:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 02:40:09,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,411 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:09,411 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2022-01-10 02:40:09,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:09,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29062579] [2022-01-10 02:40:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:09,424 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:09,426 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:09,427 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:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:09,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:40:09,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:09,584 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:09,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:09,585 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:09,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29062579] [2022-01-10 02:40:09,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29062579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:09,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:09,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:09,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783862625] [2022-01-10 02:40:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:09,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:09,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:09,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:09,617 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:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:09,791 INFO L93 Difference]: Finished difference Result 284 states and 484 transitions. [2022-01-10 02:40:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:09,793 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:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:09,802 INFO L225 Difference]: With dead ends: 284 [2022-01-10 02:40:09,802 INFO L226 Difference]: Without dead ends: 128 [2022-01-10 02:40:09,804 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:09,808 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 20 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:09,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 325 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-10 02:40:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2022-01-10 02:40:09,848 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:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2022-01-10 02:40:09,851 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2022-01-10 02:40:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:09,853 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2022-01-10 02:40:09,853 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:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2022-01-10 02:40:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 02:40:09,859 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:09,859 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,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 02:40:10,068 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:10,069 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1722912794, now seen corresponding path program 1 times [2022-01-10 02:40:10,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:10,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591142192] [2022-01-10 02:40:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:10,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:10,072 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:10,076 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:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:10,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:10,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:10,241 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:10,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:10,242 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591142192] [2022-01-10 02:40:10,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591142192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:10,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:10,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:10,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307986578] [2022-01-10 02:40:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:10,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,244 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:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,358 INFO L93 Difference]: Finished difference Result 256 states and 386 transitions. [2022-01-10 02:40:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:10,359 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:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,362 INFO L225 Difference]: With dead ends: 256 [2022-01-10 02:40:10,362 INFO L226 Difference]: Without dead ends: 150 [2022-01-10 02:40:10,363 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:10,364 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 255 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-01-10 02:40:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2022-01-10 02:40:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.4551724137931035) internal successors, (211), 145 states have internal predecessors, (211), 0 states have call successors, (0), 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,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2022-01-10 02:40:10,380 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 60 [2022-01-10 02:40:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,381 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2022-01-10 02:40:10,381 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:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2022-01-10 02:40:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:40:10,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,382 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,393 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:10,593 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:10,594 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1797387181, now seen corresponding path program 1 times [2022-01-10 02:40:10,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:10,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166180971] [2022-01-10 02:40:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:10,595 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:10,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:10,597 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:10,603 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:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:10,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:10,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:10,825 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,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:10,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:10,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166180971] [2022-01-10 02:40:10,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166180971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:10,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:10,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:10,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974774952] [2022-01-10 02:40:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:10,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:10,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:10,826 INFO L87 Difference]: Start difference. First operand 146 states and 211 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,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:10,943 INFO L93 Difference]: Finished difference Result 300 states and 441 transitions. [2022-01-10 02:40:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:10,944 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,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:10,945 INFO L225 Difference]: With dead ends: 300 [2022-01-10 02:40:10,945 INFO L226 Difference]: Without dead ends: 173 [2022-01-10 02:40:10,945 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,946 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:10,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 268 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-01-10 02:40:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2022-01-10 02:40:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 0 states have call successors, (0), 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,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2022-01-10 02:40:10,953 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 81 [2022-01-10 02:40:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:10,953 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2022-01-10 02:40:10,953 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,953 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2022-01-10 02:40:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:40:10,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:10,958 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,968 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:11,158 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:11,159 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2045533675, now seen corresponding path program 1 times [2022-01-10 02:40:11,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190025641] [2022-01-10 02:40:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,160 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,169 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:11,169 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:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:11,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:11,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,358 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:11,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,358 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190025641] [2022-01-10 02:40:11,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190025641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201537592] [2022-01-10 02:40:11,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,364 INFO L87 Difference]: Start difference. First operand 170 states and 240 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:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:11,531 INFO L93 Difference]: Finished difference Result 366 states and 534 transitions. [2022-01-10 02:40:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:11,532 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:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:11,533 INFO L225 Difference]: With dead ends: 366 [2022-01-10 02:40:11,534 INFO L226 Difference]: Without dead ends: 215 [2022-01-10 02:40:11,534 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:11,535 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 15 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:11,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:40:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-01-10 02:40:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2022-01-10 02:40:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.361904761904762) internal successors, (286), 210 states have internal predecessors, (286), 0 states have call successors, (0), 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,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 286 transitions. [2022-01-10 02:40:11,542 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 286 transitions. Word has length 81 [2022-01-10 02:40:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:11,542 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 286 transitions. [2022-01-10 02:40:11,542 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:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 286 transitions. [2022-01-10 02:40:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-10 02:40:11,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:11,544 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:11,567 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:11,750 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:11,751 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 755662145, now seen corresponding path program 1 times [2022-01-10 02:40:11,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430931981] [2022-01-10 02:40:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:11,752 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:11,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:11,754 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:11,755 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:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:11,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:11,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:11,968 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,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:11,969 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430931981] [2022-01-10 02:40:11,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430931981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:11,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:11,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:11,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970783030] [2022-01-10 02:40:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:11,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:11,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:11,970 INFO L87 Difference]: Start difference. First operand 211 states and 286 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:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,086 INFO L93 Difference]: Finished difference Result 440 states and 610 transitions. [2022-01-10 02:40:12,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,086 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:12,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,087 INFO L225 Difference]: With dead ends: 440 [2022-01-10 02:40:12,087 INFO L226 Difference]: Without dead ends: 248 [2022-01-10 02:40:12,088 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:12,088 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 29 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 270 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-01-10 02:40:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2022-01-10 02:40:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3446808510638297) internal successors, (316), 235 states have internal predecessors, (316), 0 states have call successors, (0), 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,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 316 transitions. [2022-01-10 02:40:12,094 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 316 transitions. Word has length 101 [2022-01-10 02:40:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,094 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 316 transitions. [2022-01-10 02:40:12,094 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:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 316 transitions. [2022-01-10 02:40:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:12,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,096 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:12,104 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:12,302 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:12,303 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2022-01-10 02:40:12,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465223655] [2022-01-10 02:40:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,306 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:12,308 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:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:12,532 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,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:12,533 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:12,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465223655] [2022-01-10 02:40:12,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465223655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:12,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:12,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:12,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744898809] [2022-01-10 02:40:12,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:12,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:12,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:12,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:12,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:12,534 INFO L87 Difference]: Start difference. First operand 236 states and 316 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,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:12,601 INFO L93 Difference]: Finished difference Result 666 states and 899 transitions. [2022-01-10 02:40:12,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:12,602 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,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:12,603 INFO L225 Difference]: With dead ends: 666 [2022-01-10 02:40:12,603 INFO L226 Difference]: Without dead ends: 449 [2022-01-10 02:40:12,604 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,604 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 433 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:12,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 433 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-01-10 02:40:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2022-01-10 02:40:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.3415178571428572) internal successors, (601), 448 states have internal predecessors, (601), 0 states have call successors, (0), 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,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 601 transitions. [2022-01-10 02:40:12,612 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 601 transitions. Word has length 121 [2022-01-10 02:40:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:12,612 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 601 transitions. [2022-01-10 02:40:12,612 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,612 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 601 transitions. [2022-01-10 02:40:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:12,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:12,614 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:12,622 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:12,820 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:12,820 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2022-01-10 02:40:12,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:12,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663480337] [2022-01-10 02:40:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:12,822 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:12,828 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:12,829 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:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:12,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:12,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:13,004 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:13,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:13,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:13,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663480337] [2022-01-10 02:40:13,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663480337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:13,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:13,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:13,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733354076] [2022-01-10 02:40:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:13,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:13,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:13,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:13,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:13,006 INFO L87 Difference]: Start difference. First operand 449 states and 601 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:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:13,052 INFO L93 Difference]: Finished difference Result 1090 states and 1466 transitions. [2022-01-10 02:40:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:13,052 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:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:13,055 INFO L225 Difference]: With dead ends: 1090 [2022-01-10 02:40:13,055 INFO L226 Difference]: Without dead ends: 660 [2022-01-10 02:40:13,056 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:13,056 INFO L933 BasicCegarLoop]: 254 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, 417 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:13,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 417 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:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-01-10 02:40:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2022-01-10 02:40:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.339908952959029) internal successors, (883), 659 states have internal predecessors, (883), 0 states have call successors, (0), 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,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 883 transitions. [2022-01-10 02:40:13,068 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 883 transitions. Word has length 121 [2022-01-10 02:40:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:13,069 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 883 transitions. [2022-01-10 02:40:13,072 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:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 883 transitions. [2022-01-10 02:40:13,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:13,074 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:13,074 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:13,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:13,279 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:13,280 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1728089839, now seen corresponding path program 1 times [2022-01-10 02:40:13,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:13,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689917112] [2022-01-10 02:40:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:13,281 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:13,285 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:13,309 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:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:13,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:13,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-10 02:40:13,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:13,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:13,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689917112] [2022-01-10 02:40:13,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689917112] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:13,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:13,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:13,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037351675] [2022-01-10 02:40:13,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:13,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:13,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:13,509 INFO L87 Difference]: Start difference. First operand 660 states and 883 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:13,545 INFO L93 Difference]: Finished difference Result 1325 states and 1773 transitions. [2022-01-10 02:40:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:13,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:13,547 INFO L225 Difference]: With dead ends: 1325 [2022-01-10 02:40:13,547 INFO L226 Difference]: Without dead ends: 684 [2022-01-10 02:40:13,548 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:13,548 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 10 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 346 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:13,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 346 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:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-01-10 02:40:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-01-10 02:40:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.335285505124451) internal successors, (912), 683 states have internal predecessors, (912), 0 states have call successors, (0), 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,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 912 transitions. [2022-01-10 02:40:13,559 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 912 transitions. Word has length 121 [2022-01-10 02:40:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:13,559 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 912 transitions. [2022-01-10 02:40:13,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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,559 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 912 transitions. [2022-01-10 02:40:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 02:40:13,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:13,560 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:13,569 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:13,767 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:13,767 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:13,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -305304207, now seen corresponding path program 1 times [2022-01-10 02:40:13,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:13,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425260592] [2022-01-10 02:40:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:13,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:13,771 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:13,773 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:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:13,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:13,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-10 02:40:14,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:14,018 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:14,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425260592] [2022-01-10 02:40:14,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425260592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:14,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:14,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:14,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941010383] [2022-01-10 02:40:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:14,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:14,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:14,019 INFO L87 Difference]: Start difference. First operand 684 states and 912 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:14,058 INFO L93 Difference]: Finished difference Result 1351 states and 1804 transitions. [2022-01-10 02:40:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:14,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-10 02:40:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:14,061 INFO L225 Difference]: With dead ends: 1351 [2022-01-10 02:40:14,061 INFO L226 Difference]: Without dead ends: 686 [2022-01-10 02:40:14,062 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:14,063 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:14,063 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:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-01-10 02:40:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2022-01-10 02:40:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.3343065693430658) internal successors, (914), 685 states have internal predecessors, (914), 0 states have call successors, (0), 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,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 914 transitions. [2022-01-10 02:40:14,077 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 914 transitions. Word has length 121 [2022-01-10 02:40:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:14,078 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 914 transitions. [2022-01-10 02:40:14,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 914 transitions. [2022-01-10 02:40:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 02:40:14,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:14,098 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:14,123 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:14,306 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:14,307 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -247255522, now seen corresponding path program 1 times [2022-01-10 02:40:14,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733400704] [2022-01-10 02:40:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:14,308 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:14,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:14,309 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:14,310 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:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:14,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:14,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 02:40:14,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:14,604 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:14,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733400704] [2022-01-10 02:40:14,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733400704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:14,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:14,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:14,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941594321] [2022-01-10 02:40:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:14,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:14,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:14,605 INFO L87 Difference]: Start difference. First operand 686 states and 914 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:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:14,742 INFO L93 Difference]: Finished difference Result 1446 states and 1964 transitions. [2022-01-10 02:40:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:14,746 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 159 [2022-01-10 02:40:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:14,749 INFO L225 Difference]: With dead ends: 1446 [2022-01-10 02:40:14,749 INFO L226 Difference]: Without dead ends: 781 [2022-01-10 02:40:14,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 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:14,750 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 18 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:14,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-01-10 02:40:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 770. [2022-01-10 02:40:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 1.3107932379713914) internal successors, (1008), 769 states have internal predecessors, (1008), 0 states have call successors, (0), 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,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1008 transitions. [2022-01-10 02:40:14,761 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1008 transitions. Word has length 159 [2022-01-10 02:40:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:14,761 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1008 transitions. [2022-01-10 02:40:14,761 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:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1008 transitions. [2022-01-10 02:40:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-01-10 02:40:14,763 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:14,763 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,783 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:14,971 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:14,971 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash 118327499, now seen corresponding path program 1 times [2022-01-10 02:40:14,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:14,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389204996] [2022-01-10 02:40:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:14,973 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:14,974 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:14,975 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:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:15,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:15,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-01-10 02:40:15,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:15,332 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389204996] [2022-01-10 02:40:15,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389204996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:15,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:15,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:15,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554795889] [2022-01-10 02:40:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:15,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:15,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:15,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:15,333 INFO L87 Difference]: Start difference. First operand 770 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:15,455 INFO L93 Difference]: Finished difference Result 1612 states and 2150 transitions. [2022-01-10 02:40:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 201 [2022-01-10 02:40:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:15,461 INFO L225 Difference]: With dead ends: 1612 [2022-01-10 02:40:15,461 INFO L226 Difference]: Without dead ends: 863 [2022-01-10 02:40:15,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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,462 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:15,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 265 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-01-10 02:40:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2022-01-10 02:40:15,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.294663573085847) internal successors, (1116), 862 states have internal predecessors, (1116), 0 states have call successors, (0), 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,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1116 transitions. [2022-01-10 02:40:15,474 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1116 transitions. Word has length 201 [2022-01-10 02:40:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:15,474 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1116 transitions. [2022-01-10 02:40:15,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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,475 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1116 transitions. [2022-01-10 02:40:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-01-10 02:40:15,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:15,477 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:15,486 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,684 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,685 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash 598072934, now seen corresponding path program 1 times [2022-01-10 02:40:15,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807091255] [2022-01-10 02:40:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:15,686 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:15,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:15,687 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,688 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,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:15,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:15,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-10 02:40:16,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:16,132 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807091255] [2022-01-10 02:40:16,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807091255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:16,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:16,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:16,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663021021] [2022-01-10 02:40:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:16,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:16,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:16,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:16,134 INFO L87 Difference]: Start difference. First operand 863 states and 1116 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:16,288 INFO L93 Difference]: Finished difference Result 1834 states and 2435 transitions. [2022-01-10 02:40:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:16,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2022-01-10 02:40:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:16,296 INFO L225 Difference]: With dead ends: 1834 [2022-01-10 02:40:16,297 INFO L226 Difference]: Without dead ends: 858 [2022-01-10 02:40:16,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 227 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,298 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:16,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 271 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-01-10 02:40:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2022-01-10 02:40:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 1.2905484247374563) internal successors, (1106), 857 states have internal predecessors, (1106), 0 states have call successors, (0), 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,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1106 transitions. [2022-01-10 02:40:16,313 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1106 transitions. Word has length 229 [2022-01-10 02:40:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:16,313 INFO L470 AbstractCegarLoop]: Abstraction has 858 states and 1106 transitions. [2022-01-10 02:40:16,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1106 transitions. [2022-01-10 02:40:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-10 02:40:16,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:16,316 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:16,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:16,527 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:16,527 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2022-01-10 02:40:16,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136385745] [2022-01-10 02:40:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:16,528 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:16,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:16,537 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,554 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,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:16,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:16,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-01-10 02:40:17,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:17,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:17,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136385745] [2022-01-10 02:40:17,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136385745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:17,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:17,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:17,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008402155] [2022-01-10 02:40:17,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:17,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:17,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:17,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:17,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:17,029 INFO L87 Difference]: Start difference. First operand 858 states and 1106 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:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:17,051 INFO L93 Difference]: Finished difference Result 2415 states and 3131 transitions. [2022-01-10 02:40:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:17,052 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 269 [2022-01-10 02:40:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:17,055 INFO L225 Difference]: With dead ends: 2415 [2022-01-10 02:40:17,055 INFO L226 Difference]: Without dead ends: 1074 [2022-01-10 02:40:17,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 267 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,057 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 98 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:17,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 456 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:40:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-01-10 02:40:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1072. [2022-01-10 02:40:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.2913165266106443) internal successors, (1383), 1071 states have internal predecessors, (1383), 0 states have call successors, (0), 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,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1383 transitions. [2022-01-10 02:40:17,070 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1383 transitions. Word has length 269 [2022-01-10 02:40:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:17,070 INFO L470 AbstractCegarLoop]: Abstraction has 1072 states and 1383 transitions. [2022-01-10 02:40:17,070 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:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1383 transitions. [2022-01-10 02:40:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-01-10 02:40:17,073 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:17,073 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:17,083 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:17,282 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:17,283 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 746936446, now seen corresponding path program 1 times [2022-01-10 02:40:17,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758110887] [2022-01-10 02:40:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:17,284 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:17,285 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:17,287 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:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:17,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:17,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2022-01-10 02:40:17,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:17,754 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758110887] [2022-01-10 02:40:17,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758110887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:17,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:17,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:17,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846305309] [2022-01-10 02:40:17,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:17,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:17,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:17,756 INFO L87 Difference]: Start difference. First operand 1072 states and 1383 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:17,834 INFO L93 Difference]: Finished difference Result 2259 states and 2965 transitions. [2022-01-10 02:40:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 315 [2022-01-10 02:40:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:17,837 INFO L225 Difference]: With dead ends: 2259 [2022-01-10 02:40:17,837 INFO L226 Difference]: Without dead ends: 1208 [2022-01-10 02:40:17,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 313 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,839 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:17,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 265 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-01-10 02:40:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1180. [2022-01-10 02:40:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 1.2815945716709076) internal successors, (1511), 1179 states have internal predecessors, (1511), 0 states have call successors, (0), 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,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1511 transitions. [2022-01-10 02:40:17,853 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1511 transitions. Word has length 315 [2022-01-10 02:40:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:17,853 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1511 transitions. [2022-01-10 02:40:17,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1511 transitions. [2022-01-10 02:40:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-01-10 02:40:17,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:17,856 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:17,880 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:18,064 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:18,065 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:18,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1865013778, now seen corresponding path program 1 times [2022-01-10 02:40:18,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:18,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696105118] [2022-01-10 02:40:18,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:18,066 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:18,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:18,067 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:18,108 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:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:18,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:18,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-01-10 02:40:18,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:18,456 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696105118] [2022-01-10 02:40:18,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696105118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:18,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:18,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:18,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869372490] [2022-01-10 02:40:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:18,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:18,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:18,458 INFO L87 Difference]: Start difference. First operand 1180 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:18,581 INFO L93 Difference]: Finished difference Result 2463 states and 3197 transitions. [2022-01-10 02:40:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2022-01-10 02:40:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:18,584 INFO L225 Difference]: With dead ends: 2463 [2022-01-10 02:40:18,585 INFO L226 Difference]: Without dead ends: 1304 [2022-01-10 02:40:18,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 336 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,588 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:18,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 265 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-01-10 02:40:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1296. [2022-01-10 02:40:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 1.271814671814672) internal successors, (1647), 1295 states have internal predecessors, (1647), 0 states have call successors, (0), 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,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1647 transitions. [2022-01-10 02:40:18,609 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1647 transitions. Word has length 338 [2022-01-10 02:40:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:18,609 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 1647 transitions. [2022-01-10 02:40:18,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:40:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1647 transitions. [2022-01-10 02:40:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2022-01-10 02:40:18,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:18,612 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,622 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,823 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,823 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:18,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2022-01-10 02:40:18,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:18,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559016812] [2022-01-10 02:40:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:18,824 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:18,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:18,825 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,827 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,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:18,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:18,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2022-01-10 02:40:19,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:19,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:19,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559016812] [2022-01-10 02:40:19,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559016812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:19,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:19,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:19,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39640205] [2022-01-10 02:40:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:19,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:19,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:19,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:19,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:19,423 INFO L87 Difference]: Start difference. First operand 1296 states and 1647 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:19,444 INFO L93 Difference]: Finished difference Result 3838 states and 4879 transitions. [2022-01-10 02:40:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 370 [2022-01-10 02:40:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:19,451 INFO L225 Difference]: With dead ends: 3838 [2022-01-10 02:40:19,451 INFO L226 Difference]: Without dead ends: 2563 [2022-01-10 02:40:19,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 368 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:19,453 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 123 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 370 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:19,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 370 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:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2022-01-10 02:40:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2561. [2022-01-10 02:40:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2560 states have (on average 1.26875) internal successors, (3248), 2560 states have internal predecessors, (3248), 0 states have call successors, (0), 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:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3248 transitions. [2022-01-10 02:40:19,486 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3248 transitions. Word has length 370 [2022-01-10 02:40:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:19,487 INFO L470 AbstractCegarLoop]: Abstraction has 2561 states and 3248 transitions. [2022-01-10 02:40:19,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3248 transitions. [2022-01-10 02:40:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-01-10 02:40:19,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:19,489 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 02:40:19,712 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,712 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash -59651589, now seen corresponding path program 1 times [2022-01-10 02:40:19,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:19,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507883401] [2022-01-10 02:40:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:19,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:19,724 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,751 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,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:19,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 875 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-01-10 02:40:20,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 875 proven. 26 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-01-10 02:40:20,812 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:20,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507883401] [2022-01-10 02:40:20,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507883401] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:20,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:20,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-01-10 02:40:20,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108704833] [2022-01-10 02:40:20,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:20,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:40:20,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:20,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:40:20,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:40:20,813 INFO L87 Difference]: Start difference. First operand 2561 states and 3248 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:20,999 INFO L93 Difference]: Finished difference Result 7953 states and 10198 transitions. [2022-01-10 02:40:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:40:21,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 371 [2022-01-10 02:40:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:21,011 INFO L225 Difference]: With dead ends: 7953 [2022-01-10 02:40:21,011 INFO L226 Difference]: Without dead ends: 5413 [2022-01-10 02:40:21,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 739 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:21,014 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 149 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:21,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 570 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2022-01-10 02:40:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 3449. [2022-01-10 02:40:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 3448 states have (on average 1.2900232018561484) internal successors, (4448), 3448 states have internal predecessors, (4448), 0 states have call successors, (0), 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,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4448 transitions. [2022-01-10 02:40:21,061 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4448 transitions. Word has length 371 [2022-01-10 02:40:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:21,062 INFO L470 AbstractCegarLoop]: Abstraction has 3449 states and 4448 transitions. [2022-01-10 02:40:21,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4448 transitions. [2022-01-10 02:40:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2022-01-10 02:40:21,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:21,065 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:21,075 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:21,273 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:21,273 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1792598736, now seen corresponding path program 1 times [2022-01-10 02:40:21,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:21,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83236797] [2022-01-10 02:40:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:21,275 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:21,278 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:21,280 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:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:21,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:21,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 916 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2022-01-10 02:40:21,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:21,885 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:21,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83236797] [2022-01-10 02:40:21,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83236797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:21,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:21,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:21,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219166376] [2022-01-10 02:40:21,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:21,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:21,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:21,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:21,886 INFO L87 Difference]: Start difference. First operand 3449 states and 4448 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:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:22,049 INFO L93 Difference]: Finished difference Result 7223 states and 9379 transitions. [2022-01-10 02:40:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:22,049 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 401 [2022-01-10 02:40:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:22,087 INFO L225 Difference]: With dead ends: 7223 [2022-01-10 02:40:22,087 INFO L226 Difference]: Without dead ends: 3795 [2022-01-10 02:40:22,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 399 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:22,091 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:22,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 271 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2022-01-10 02:40:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 3609. [2022-01-10 02:40:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 3608 states have (on average 1.288248337028825) internal successors, (4648), 3608 states have internal predecessors, (4648), 0 states have call successors, (0), 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,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4648 transitions. [2022-01-10 02:40:22,184 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4648 transitions. Word has length 401 [2022-01-10 02:40:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:22,184 INFO L470 AbstractCegarLoop]: Abstraction has 3609 states and 4648 transitions. [2022-01-10 02:40:22,184 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:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4648 transitions. [2022-01-10 02:40:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2022-01-10 02:40:22,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:22,188 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:22,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-01-10 02:40:22,398 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:22,398 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash 571180815, now seen corresponding path program 1 times [2022-01-10 02:40:22,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864619987] [2022-01-10 02:40:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:22,399 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:22,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:22,400 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:22,402 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:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:22,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:22,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 983 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2022-01-10 02:40:23,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:23,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:23,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864619987] [2022-01-10 02:40:23,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864619987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:23,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:23,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:23,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727941839] [2022-01-10 02:40:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:23,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:23,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:23,078 INFO L87 Difference]: Start difference. First operand 3609 states and 4648 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:23,221 INFO L93 Difference]: Finished difference Result 7773 states and 10231 transitions. [2022-01-10 02:40:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 402 [2022-01-10 02:40:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:23,231 INFO L225 Difference]: With dead ends: 7773 [2022-01-10 02:40:23,231 INFO L226 Difference]: Without dead ends: 4185 [2022-01-10 02:40:23,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 400 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:23,235 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:23,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 265 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2022-01-10 02:40:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4153. [2022-01-10 02:40:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4153 states, 4152 states have (on average 1.2697495183044316) internal successors, (5272), 4152 states have internal predecessors, (5272), 0 states have call successors, (0), 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:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4153 states to 4153 states and 5272 transitions. [2022-01-10 02:40:23,327 INFO L78 Accepts]: Start accepts. Automaton has 4153 states and 5272 transitions. Word has length 402 [2022-01-10 02:40:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:23,327 INFO L470 AbstractCegarLoop]: Abstraction has 4153 states and 5272 transitions. [2022-01-10 02:40:23,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4153 states and 5272 transitions. [2022-01-10 02:40:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-01-10 02:40:23,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:23,331 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:23,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 02:40:23,538 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:23,539 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1646161403, now seen corresponding path program 1 times [2022-01-10 02:40:23,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:23,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749029207] [2022-01-10 02:40:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:23,540 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:23,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:23,541 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:23,543 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:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:23,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:23,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 1162 proven. 0 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2022-01-10 02:40:24,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:24,152 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:24,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749029207] [2022-01-10 02:40:24,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749029207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:24,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:24,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:24,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003493862] [2022-01-10 02:40:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:24,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:24,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:24,153 INFO L87 Difference]: Start difference. First operand 4153 states and 5272 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:24,319 INFO L93 Difference]: Finished difference Result 8893 states and 11543 transitions. [2022-01-10 02:40:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:24,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 433 [2022-01-10 02:40:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:24,347 INFO L225 Difference]: With dead ends: 8893 [2022-01-10 02:40:24,348 INFO L226 Difference]: Without dead ends: 4761 [2022-01-10 02:40:24,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 431 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:24,356 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:24,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 265 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2022-01-10 02:40:24,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4729. [2022-01-10 02:40:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4729 states, 4728 states have (on average 1.2538071065989849) internal successors, (5928), 4728 states have internal predecessors, (5928), 0 states have call successors, (0), 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:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 5928 transitions. [2022-01-10 02:40:24,495 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 5928 transitions. Word has length 433 [2022-01-10 02:40:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:24,495 INFO L470 AbstractCegarLoop]: Abstraction has 4729 states and 5928 transitions. [2022-01-10 02:40:24,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 5928 transitions. [2022-01-10 02:40:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2022-01-10 02:40:24,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:24,500 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:24,522 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:24,715 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:24,715 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash 912404788, now seen corresponding path program 1 times [2022-01-10 02:40:24,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:24,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728004120] [2022-01-10 02:40:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:24,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:24,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:24,717 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:24,719 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:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:24,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:40:24,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2331 backedges. 1351 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2022-01-10 02:40:25,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:40:25,390 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:25,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728004120] [2022-01-10 02:40:25,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728004120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:40:25,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:40:25,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:40:25,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604880072] [2022-01-10 02:40:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:40:25,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:40:25,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:25,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:40:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:40:25,392 INFO L87 Difference]: Start difference. First operand 4729 states and 5928 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:25,529 INFO L93 Difference]: Finished difference Result 9355 states and 11821 transitions. [2022-01-10 02:40:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:40:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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 466 [2022-01-10 02:40:25,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:25,549 INFO L225 Difference]: With dead ends: 9355 [2022-01-10 02:40:25,549 INFO L226 Difference]: Without dead ends: 4197 [2022-01-10 02:40:25,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 464 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:25,553 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:25,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 264 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:40:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4197 states. [2022-01-10 02:40:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4197 to 3719. [2022-01-10 02:40:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3718 states have (on average 1.2205486820871436) internal successors, (4538), 3718 states have internal predecessors, (4538), 0 states have call successors, (0), 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,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 4538 transitions. [2022-01-10 02:40:25,615 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 4538 transitions. Word has length 466 [2022-01-10 02:40:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:25,615 INFO L470 AbstractCegarLoop]: Abstraction has 3719 states and 4538 transitions. [2022-01-10 02:40:25,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4538 transitions. [2022-01-10 02:40:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2022-01-10 02:40:25,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:40:25,619 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:25,641 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:25,827 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:25,827 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:40:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:40:25,828 INFO L85 PathProgramCache]: Analyzing trace with hash 325769247, now seen corresponding path program 1 times [2022-01-10 02:40:25,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:40:25,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820695014] [2022-01-10 02:40:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:40:25,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:40:25,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:40:25,829 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:25,831 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:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:40:25,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:40:25,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:40:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 1308 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2022-01-10 02:40:26,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:40:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2727 backedges. 1308 proven. 26 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2022-01-10 02:40:26,905 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:40:26,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820695014] [2022-01-10 02:40:26,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820695014] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:40:26,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:40:26,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:40:26,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95395146] [2022-01-10 02:40:26,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:40:26,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:40:26,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:40:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:40:26,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:40:26,906 INFO L87 Difference]: Start difference. First operand 3719 states and 4538 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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 L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:40:27,159 INFO L93 Difference]: Finished difference Result 5040 states and 6159 transitions. [2022-01-10 02:40:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:40:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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 504 [2022-01-10 02:40:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:40:27,160 INFO L225 Difference]: With dead ends: 5040 [2022-01-10 02:40:27,160 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:40:27,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1005 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:27,162 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 245 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:40:27,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 486 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:40:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:40:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:40:27,163 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:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:40:27,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 504 [2022-01-10 02:40:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:40:27,163 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:40:27,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:40:27,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:40:27,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:40:27,185 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:27,374 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:27,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:40:29,240 INFO L854 garLoopResultBuilder]: At program point L597(lines 109 665) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse5 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse9 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32)) .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse0 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse4 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse5) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse6) (and .cse0 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse4) (and .cse0 .cse7 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse8 .cse7) (and .cse0 .cse7 .cse5) (and .cse0 .cse6 .cse1) (and .cse0 .cse7 .cse3) (and .cse0 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse8) (and .cse0 .cse9 .cse7) (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (and .cse2 .cse9) (and .cse0 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse0 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 568) no Hoare annotation was computed. [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 385) no Hoare annotation was computed. [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L367-2(lines 366 383) no Hoare annotation was computed. [2022-01-10 02:40:29,240 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 604) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 615) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 626) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L335-1(lines 335 344) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L861 garLoopResultBuilder]: At program point L666(lines 108 667) the Hoare annotation is: true [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 603) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 614) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 625) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L635(lines 635 663) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 256) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L854 garLoopResultBuilder]: At program point L206(lines 202 604) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse1 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))))) [2022-01-10 02:40:29,241 INFO L854 garLoopResultBuilder]: At program point L173(lines 169 615) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L636(lines 636 660) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L570(lines 570 574) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L537(lines 537 541) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L570-2(lines 570 574) no Hoare annotation was computed. [2022-01-10 02:40:29,241 INFO L858 garLoopResultBuilder]: For program point L537-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 674) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L637(lines 637 646) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L670-2(lines 670 674) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L637-2(lines 636 658) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L472(lines 472 483) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L854 garLoopResultBuilder]: At program point L373(lines 356 391) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 602) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 613) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 624) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L854 garLoopResultBuilder]: At program point L109-2(lines 109 665) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse5 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (= (_ bv8496 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= (_ bv8592 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse9 (= (_ bv8608 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8466 32)) .cse1) (and .cse2 .cse3) (and .cse2 .cse0) (and .cse0 (= (_ bv8560 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse4 (= (_ bv8672 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse5) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)) .cse6) (and .cse0 (= (_ bv8544 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse4) (and .cse0 .cse7 (= (_ bv8576 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| (_ bv8464 32)) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))) (and .cse0 .cse8 .cse7) (and .cse0 .cse7 .cse5) (and .cse0 .cse6 .cse1) (and .cse0 .cse7 .cse3) (and .cse0 (= (_ bv8512 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse2 .cse8) (and .cse0 .cse9 .cse7) (= (_ bv3 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (and .cse2 .cse9) (and .cse0 (= (_ bv8656 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse1) (and .cse0 (= (_ bv8528 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) [2022-01-10 02:40:29,242 INFO L854 garLoopResultBuilder]: At program point L407(lines 398 429) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,242 INFO L854 garLoopResultBuilder]: At program point L176(lines 175 613) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (= (_ bv8448 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv3 32)) .cse1) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)) .cse1) (and .cse3 .cse0 .cse1) (and .cse3 .cse2 .cse1))) [2022-01-10 02:40:29,242 INFO L854 garLoopResultBuilder]: At program point L143(lines 136 626) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse2 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse1 .cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (and .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv0 32))))) [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L639(lines 639 643) no Hoare annotation was computed. [2022-01-10 02:40:29,242 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 415) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L211(lines 211 601) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 612) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 623) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 634) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L476(lines 476 480) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L854 garLoopResultBuilder]: At program point L212(lines 208 602) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32)))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (and .cse1 .cse0))) [2022-01-10 02:40:29,243 INFO L861 garLoopResultBuilder]: At program point L113(lines 112 634) the Hoare annotation is: true [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 514) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L510-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 600) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 611) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 622) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 633) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L861 garLoopResultBuilder]: At program point L215(lines 214 600) the Hoare annotation is: true [2022-01-10 02:40:29,243 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 612) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse1 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32))))) [2022-01-10 02:40:29,243 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 623) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse3 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32)))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv1 32)))) (or (and .cse0 .cse1) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))) (and .cse2 .cse3) (and .cse1 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32)))) (and .cse0 .cse2))) [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L580(lines 580 590) no Hoare annotation was computed. [2022-01-10 02:40:29,243 INFO L858 garLoopResultBuilder]: For program point L580-1(lines 580 590) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 320) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L316-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 610) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 621) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 632) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 449 461) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 599) the Hoare annotation is: true [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L861 garLoopResultBuilder]: At program point L681(lines 74 683) the Hoare annotation is: true [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L648(lines 648 654) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L854 garLoopResultBuilder]: At program point L417(lines 408 428) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L351-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L861 garLoopResultBuilder]: At program point L682(lines 19 684) the Hoare annotation is: true [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L583(lines 583 587) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 609) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 620) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 631) no Hoare annotation was computed. [2022-01-10 02:40:29,244 INFO L858 garLoopResultBuilder]: For program point L452(lines 452 457) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 610) the Hoare annotation is: (or (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)))) [2022-01-10 02:40:29,245 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 621) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L861 garLoopResultBuilder]: At program point L222(lines 115 633) the Hoare annotation is: true [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 524) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 608) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 619) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 630) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 74 683) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 607) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 618) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 629) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 390) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 330) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-01-10 02:40:29,245 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 608) the Hoare annotation is: (or (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8576 32)))) [2022-01-10 02:40:29,246 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 619) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L559(lines 559 563) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 606) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 617) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 628) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L854 garLoopResultBuilder]: At program point L560(lines 74 683) the Hoare annotation is: false [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 389) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L362-1(lines 362 389) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 629) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 677) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 386) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L264(lines 264 276) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L861 garLoopResultBuilder]: At program point L694(lines 685 696) the Hoare annotation is: true [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 270) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 605) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 616) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 627) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 535) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 429) no Hoare annotation was computed. [2022-01-10 02:40:29,246 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 303) no Hoare annotation was computed. [2022-01-10 02:40:29,247 INFO L858 garLoopResultBuilder]: For program point L299-2(lines 219 596) no Hoare annotation was computed. [2022-01-10 02:40:29,247 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 606) the Hoare annotation is: (or (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32)) (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (not (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| (_ bv8640 32))))) [2022-01-10 02:40:29,247 INFO L854 garLoopResultBuilder]: At program point L167(lines 163 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv2 32))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| (_ bv0 32))))) (or (and .cse0 (not (= (_ bv8640 32) |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse1 .cse0) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| (_ bv3 32))))) [2022-01-10 02:40:29,247 INFO L861 garLoopResultBuilder]: At program point L134(lines 133 627) the Hoare annotation is: true [2022-01-10 02:40:29,249 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:40:29,249 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:40:29,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:40:29 BoogieIcfgContainer [2022-01-10 02:40:29,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:40:29,274 INFO L158 Benchmark]: Toolchain (without parser) took 20952.15ms. Allocated memory was 178.3MB in the beginning and 382.7MB in the end (delta: 204.5MB). Free memory was 120.8MB in the beginning and 204.2MB in the end (delta: -83.4MB). Peak memory consumption was 202.8MB. Max. memory is 8.0GB. [2022-01-10 02:40:29,274 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:40:29,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.86ms. Allocated memory was 178.3MB in the beginning and 265.3MB in the end (delta: 87.0MB). Free memory was 120.6MB in the beginning and 232.4MB in the end (delta: -111.8MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-01-10 02:40:29,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 265.3MB. Free memory was 232.4MB in the beginning and 229.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:29,275 INFO L158 Benchmark]: Boogie Preprocessor took 24.90ms. Allocated memory is still 265.3MB. Free memory was 229.8MB in the beginning and 227.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:40:29,275 INFO L158 Benchmark]: RCFGBuilder took 630.98ms. Allocated memory is still 265.3MB. Free memory was 227.7MB in the beginning and 200.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-01-10 02:40:29,275 INFO L158 Benchmark]: TraceAbstraction took 19927.99ms. Allocated memory was 265.3MB in the beginning and 382.7MB in the end (delta: 117.4MB). Free memory was 199.9MB in the beginning and 204.2MB in the end (delta: -4.3MB). Peak memory consumption was 194.4MB. Max. memory is 8.0GB. [2022-01-10 02:40:29,276 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.09ms. Allocated memory is still 178.3MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.86ms. Allocated memory was 178.3MB in the beginning and 265.3MB in the end (delta: 87.0MB). Free memory was 120.6MB in the beginning and 232.4MB in the end (delta: -111.8MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 265.3MB. Free memory was 232.4MB in the beginning and 229.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.90ms. Allocated memory is still 265.3MB. Free memory was 229.8MB in the beginning and 227.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.98ms. Allocated memory is still 265.3MB. Free memory was 227.7MB in the beginning and 200.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 19927.99ms. Allocated memory was 265.3MB in the beginning and 382.7MB in the end (delta: 117.4MB). Free memory was 199.9MB in the beginning and 204.2MB in the end (delta: -4.3MB). Peak memory consumption was 194.4MB. 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: 677]: 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: 19.9s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1065 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1065 mSDsluCounter, 7175 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2801 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2135 IncrementalHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 4374 mSDtfsCounter, 2135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6168 GetRequests, 6138 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4729occurred in iteration=20, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 2769 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 268 NumberOfFragments, 834 HoareAnnotationTreeSize, 29 FomulaSimplifications, 962 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 29 FomulaSimplificationsInter, 2994 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 5309 NumberOfCodeBlocks, 5309 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6160 ConstructedInterpolants, 0 QuantifiedInterpolants, 8402 SizeOfPredicates, 5 NumberOfNonLiveVariables, 6239 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 21497/21601 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: 196]: Loop Invariant Derived loop invariant: !(s__hit == 0bv32) || ((blastFlag == 2bv32 && 8640bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((blastFlag == 3bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 3bv32) && 8448bv32 == s__state)) || ((!(s__hit == 0bv32) && blastFlag == 2bv32) && 8448bv32 == s__state) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((blastFlag == 2bv32 && s__state == 8466bv32) && !(s__s3__tmp__next_state___0 == 8640bv32)) || (!(s__hit == 0bv32) && 8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (blastFlag == 2bv32 && 8560bv32 == s__state)) || ((blastFlag == 3bv32 && 8672bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || (blastFlag == 2bv32 && 8544bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || ((blastFlag == 2bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || ((blastFlag == 2bv32 && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8640bv32 == s__state)) || (blastFlag == 2bv32 && 8512bv32 == s__state)) || (!(s__hit == 0bv32) && 8592bv32 == s__state)) || ((blastFlag == 2bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || 3bv32 == s__state) || (!(s__hit == 0bv32) && 8608bv32 == s__state)) || ((blastFlag == 2bv32 && 8656bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (blastFlag == 2bv32 && 8528bv32 == s__state) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: !(s__hit == 0bv32) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 685]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((blastFlag == 2bv32 && !(8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (!(s__hit == 0bv32) && blastFlag == 3bv32) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || (blastFlag == 1bv32 && !(8640bv32 == s__state))) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (!(s__hit == 0bv32) && blastFlag == 1bv32) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((blastFlag == 2bv32 && s__state == 8466bv32) && !(s__s3__tmp__next_state___0 == 8640bv32)) || (!(s__hit == 0bv32) && 8640bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 2bv32)) || (blastFlag == 2bv32 && 8560bv32 == s__state)) || ((blastFlag == 3bv32 && 8672bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 3bv32 && s__s3__tmp__next_state___0 == 3bv32) && 8448bv32 == s__state)) || (blastFlag == 1bv32 && 8496bv32 == s__state)) || (blastFlag == 2bv32 && 8544bv32 == s__state)) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8576bv32 == s__state)) || (s__state == 8464bv32 && blastFlag == 0bv32)) || ((blastFlag == 2bv32 && 8592bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8448bv32 == s__state)) || ((blastFlag == 2bv32 && 8496bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || ((blastFlag == 2bv32 && s__s3__tmp__next_state___0 == 8576bv32) && 8640bv32 == s__state)) || (blastFlag == 2bv32 && 8512bv32 == s__state)) || (!(s__hit == 0bv32) && 8592bv32 == s__state)) || ((blastFlag == 2bv32 && 8608bv32 == s__state) && s__s3__tmp__next_state___0 == 8576bv32)) || 3bv32 == s__state) || (!(s__hit == 0bv32) && 8608bv32 == s__state)) || ((blastFlag == 2bv32 && 8656bv32 == s__state) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (blastFlag == 2bv32 && 8528bv32 == s__state) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: !(s__hit == 0bv32) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32))) || (!(8640bv32 == s__state) && blastFlag == 0bv32) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && s__s3__tmp__next_state___0 == 8576bv32) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && blastFlag == 2bv32) || (!(s__hit == 0bv32) && blastFlag == 3bv32)) || ((blastFlag == 2bv32 && !(8640bv32 == s__state)) && !(s__s3__tmp__next_state___0 == 8640bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 02:40:29,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...