java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:19:31,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:19:31,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:19:31,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:19:31,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:19:31,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:19:31,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:19:31,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:19:31,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:19:31,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:19:31,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:19:31,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:19:31,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:19:31,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:19:31,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:19:31,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:19:31,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:19:31,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:19:31,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:19:31,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:19:31,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:19:31,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:19:31,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:19:31,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:19:31,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:19:31,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:19:31,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:19:32,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:19:32,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:19:32,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:19:32,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:19:32,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:19:32,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:19:32,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:19:32,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:19:32,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:19:32,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:19:32,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:19:32,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:19:32,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:19:32,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:19:32,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:19:32,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:19:32,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:19:32,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:19:32,026 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:19:32,026 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:19:32,027 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:19:32,027 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:19:32,027 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:19:32,027 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:19:32,027 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:19:32,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:19:32,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:19:32,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:19:32,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:19:32,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:19:32,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:19:32,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:19:32,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:19:32,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:19:32,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:19:32,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:19:32,030 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:19:32,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:19:32,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:19:32,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:19:32,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:19:32,031 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:19:32,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:19:32,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:19:32,032 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:19:32,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:19:32,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:19:32,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:19:32,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:19:32,078 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:19:32,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:19:32,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9122aca83/d60b3a70abd24ff08e9b0cd901c10855/FLAGedf3f6555 [2019-09-10 08:19:32,668 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:19:32,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:19:32,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9122aca83/d60b3a70abd24ff08e9b0cd901c10855/FLAGedf3f6555 [2019-09-10 08:19:32,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9122aca83/d60b3a70abd24ff08e9b0cd901c10855 [2019-09-10 08:19:33,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:19:33,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:19:33,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:19:33,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:19:33,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:19:33,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:19:32" (1/1) ... [2019-09-10 08:19:33,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d42effb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33, skipping insertion in model container [2019-09-10 08:19:33,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:19:32" (1/1) ... [2019-09-10 08:19:33,023 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:19:33,071 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:19:33,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:19:33,470 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:19:33,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:19:33,578 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:19:33,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33 WrapperNode [2019-09-10 08:19:33,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:19:33,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:19:33,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:19:33,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:19:33,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... [2019-09-10 08:19:33,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:19:33,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:19:33,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:19:33,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:19:33,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:19:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:19:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:19:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:19:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:19:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:19:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:19:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:19:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:19:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:19:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:19:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:19:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:19:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:19:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:19:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:19:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:19:34,460 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:19:34,461 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:19:34,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:19:34 BoogieIcfgContainer [2019-09-10 08:19:34,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:19:34,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:19:34,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:19:34,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:19:34,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:19:32" (1/3) ... [2019-09-10 08:19:34,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dce0800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:19:34, skipping insertion in model container [2019-09-10 08:19:34,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:19:33" (2/3) ... [2019-09-10 08:19:34,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dce0800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:19:34, skipping insertion in model container [2019-09-10 08:19:34,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:19:34" (3/3) ... [2019-09-10 08:19:34,471 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:19:34,481 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:19:34,507 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:19:34,526 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:19:34,555 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:19:34,555 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:19:34,556 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:19:34,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:19:34,556 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:19:34,556 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:19:34,556 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:19:34,556 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:19:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-09-10 08:19:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:19:34,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:34,587 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:34,589 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash 690229661, now seen corresponding path program 1 times [2019-09-10 08:19:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:34,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:34,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:34,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:34,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:35,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:35,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:35,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:35,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:35,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,114 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-09-10 08:19:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:35,183 INFO L93 Difference]: Finished difference Result 191 states and 308 transitions. [2019-09-10 08:19:35,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:35,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 08:19:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:35,200 INFO L225 Difference]: With dead ends: 191 [2019-09-10 08:19:35,200 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 08:19:35,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 08:19:35,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-09-10 08:19:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-10 08:19:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2019-09-10 08:19:35,257 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 77 [2019-09-10 08:19:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:35,258 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2019-09-10 08:19:35,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2019-09-10 08:19:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:19:35,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:35,262 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:35,262 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:35,263 INFO L82 PathProgramCache]: Analyzing trace with hash -675217057, now seen corresponding path program 1 times [2019-09-10 08:19:35,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:35,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:35,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:35,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:35,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:35,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:35,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,425 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand 3 states. [2019-09-10 08:19:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:35,474 INFO L93 Difference]: Finished difference Result 299 states and 445 transitions. [2019-09-10 08:19:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:35,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 08:19:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:35,483 INFO L225 Difference]: With dead ends: 299 [2019-09-10 08:19:35,483 INFO L226 Difference]: Without dead ends: 299 [2019-09-10 08:19:35,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-10 08:19:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2019-09-10 08:19:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-10 08:19:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2019-09-10 08:19:35,516 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 78 [2019-09-10 08:19:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:35,517 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2019-09-10 08:19:35,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2019-09-10 08:19:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:19:35,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:35,520 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:35,520 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 435331309, now seen corresponding path program 1 times [2019-09-10 08:19:35,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:35,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:35,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:35,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:35,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:35,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:35,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:35,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,660 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 3 states. [2019-09-10 08:19:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:35,698 INFO L93 Difference]: Finished difference Result 515 states and 785 transitions. [2019-09-10 08:19:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:35,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 08:19:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:35,702 INFO L225 Difference]: With dead ends: 515 [2019-09-10 08:19:35,703 INFO L226 Difference]: Without dead ends: 515 [2019-09-10 08:19:35,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-10 08:19:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2019-09-10 08:19:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-10 08:19:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 784 transitions. [2019-09-10 08:19:35,749 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 784 transitions. Word has length 79 [2019-09-10 08:19:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:35,749 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 784 transitions. [2019-09-10 08:19:35,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 784 transitions. [2019-09-10 08:19:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:19:35,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:35,757 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:35,759 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash -903037179, now seen corresponding path program 1 times [2019-09-10 08:19:35,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:35,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:35,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:35,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:35,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:35,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:35,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:35,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,916 INFO L87 Difference]: Start difference. First operand 513 states and 784 transitions. Second operand 3 states. [2019-09-10 08:19:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:35,954 INFO L93 Difference]: Finished difference Result 915 states and 1409 transitions. [2019-09-10 08:19:35,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:35,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 08:19:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:35,964 INFO L225 Difference]: With dead ends: 915 [2019-09-10 08:19:35,964 INFO L226 Difference]: Without dead ends: 915 [2019-09-10 08:19:35,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-10 08:19:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-09-10 08:19:35,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-10 08:19:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1408 transitions. [2019-09-10 08:19:36,004 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1408 transitions. Word has length 80 [2019-09-10 08:19:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:36,006 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1408 transitions. [2019-09-10 08:19:36,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1408 transitions. [2019-09-10 08:19:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:19:36,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:36,014 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:36,015 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:36,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash -441467371, now seen corresponding path program 1 times [2019-09-10 08:19:36,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:36,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:36,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:36,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:36,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:36,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:36,154 INFO L87 Difference]: Start difference. First operand 913 states and 1408 transitions. Second operand 3 states. [2019-09-10 08:19:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:36,184 INFO L93 Difference]: Finished difference Result 1651 states and 2545 transitions. [2019-09-10 08:19:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:36,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 08:19:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:36,194 INFO L225 Difference]: With dead ends: 1651 [2019-09-10 08:19:36,194 INFO L226 Difference]: Without dead ends: 1651 [2019-09-10 08:19:36,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-09-10 08:19:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2019-09-10 08:19:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-10 08:19:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2544 transitions. [2019-09-10 08:19:36,241 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2544 transitions. Word has length 81 [2019-09-10 08:19:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:36,242 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2544 transitions. [2019-09-10 08:19:36,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2544 transitions. [2019-09-10 08:19:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:19:36,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:36,247 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:36,247 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash -22564349, now seen corresponding path program 1 times [2019-09-10 08:19:36,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:36,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:36,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:36,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:36,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:36,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:36,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:36,385 INFO L87 Difference]: Start difference. First operand 1649 states and 2544 transitions. Second operand 5 states. [2019-09-10 08:19:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:36,531 INFO L93 Difference]: Finished difference Result 1649 states and 2512 transitions. [2019-09-10 08:19:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:36,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:19:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:36,540 INFO L225 Difference]: With dead ends: 1649 [2019-09-10 08:19:36,541 INFO L226 Difference]: Without dead ends: 1649 [2019-09-10 08:19:36,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-09-10 08:19:36,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-09-10 08:19:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-10 08:19:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2512 transitions. [2019-09-10 08:19:36,584 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2512 transitions. Word has length 82 [2019-09-10 08:19:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:36,584 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2512 transitions. [2019-09-10 08:19:36,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2512 transitions. [2019-09-10 08:19:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:19:36,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:36,586 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:36,586 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:36,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1698766526, now seen corresponding path program 1 times [2019-09-10 08:19:36,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:36,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:36,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:36,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:36,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:36,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:36,675 INFO L87 Difference]: Start difference. First operand 1649 states and 2512 transitions. Second operand 5 states. [2019-09-10 08:19:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:36,802 INFO L93 Difference]: Finished difference Result 1649 states and 2496 transitions. [2019-09-10 08:19:36,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:36,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:19:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:36,811 INFO L225 Difference]: With dead ends: 1649 [2019-09-10 08:19:36,836 INFO L226 Difference]: Without dead ends: 1649 [2019-09-10 08:19:36,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-09-10 08:19:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-09-10 08:19:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-10 08:19:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2496 transitions. [2019-09-10 08:19:36,877 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2496 transitions. Word has length 82 [2019-09-10 08:19:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:36,877 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2496 transitions. [2019-09-10 08:19:36,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2496 transitions. [2019-09-10 08:19:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:19:36,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:36,879 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:36,879 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash -143264007, now seen corresponding path program 1 times [2019-09-10 08:19:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:36,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:37,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:37,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:37,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:37,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:37,010 INFO L87 Difference]: Start difference. First operand 1649 states and 2496 transitions. Second operand 5 states. [2019-09-10 08:19:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:37,153 INFO L93 Difference]: Finished difference Result 1649 states and 2480 transitions. [2019-09-10 08:19:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:19:37,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:19:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:37,162 INFO L225 Difference]: With dead ends: 1649 [2019-09-10 08:19:37,162 INFO L226 Difference]: Without dead ends: 1649 [2019-09-10 08:19:37,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:19:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-09-10 08:19:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-09-10 08:19:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-10 08:19:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2480 transitions. [2019-09-10 08:19:37,199 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2480 transitions. Word has length 82 [2019-09-10 08:19:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:37,199 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2480 transitions. [2019-09-10 08:19:37,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2480 transitions. [2019-09-10 08:19:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:19:37,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:37,200 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:37,201 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:37,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:37,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1607335564, now seen corresponding path program 1 times [2019-09-10 08:19:37,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:37,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:37,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:37,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:37,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:37,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:37,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:37,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:37,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:37,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:37,404 INFO L87 Difference]: Start difference. First operand 1649 states and 2480 transitions. Second operand 8 states. [2019-09-10 08:19:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:37,812 INFO L93 Difference]: Finished difference Result 16067 states and 24121 transitions. [2019-09-10 08:19:37,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:19:37,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 08:19:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:37,919 INFO L225 Difference]: With dead ends: 16067 [2019-09-10 08:19:37,919 INFO L226 Difference]: Without dead ends: 16067 [2019-09-10 08:19:37,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:19:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16067 states. [2019-09-10 08:19:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16067 to 4849. [2019-09-10 08:19:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-09-10 08:19:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 7280 transitions. [2019-09-10 08:19:38,139 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 7280 transitions. Word has length 82 [2019-09-10 08:19:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:38,140 INFO L475 AbstractCegarLoop]: Abstraction has 4849 states and 7280 transitions. [2019-09-10 08:19:38,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 7280 transitions. [2019-09-10 08:19:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:19:38,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:38,142 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:38,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:38,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:38,142 INFO L82 PathProgramCache]: Analyzing trace with hash 645559087, now seen corresponding path program 1 times [2019-09-10 08:19:38,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:38,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:38,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:38,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:38,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:38,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:38,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:38,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:38,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:38,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:38,255 INFO L87 Difference]: Start difference. First operand 4849 states and 7280 transitions. Second operand 3 states. [2019-09-10 08:19:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:38,329 INFO L93 Difference]: Finished difference Result 9139 states and 13361 transitions. [2019-09-10 08:19:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:38,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 08:19:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:38,351 INFO L225 Difference]: With dead ends: 9139 [2019-09-10 08:19:38,351 INFO L226 Difference]: Without dead ends: 9139 [2019-09-10 08:19:38,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-09-10 08:19:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 9041. [2019-09-10 08:19:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9041 states. [2019-09-10 08:19:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 13264 transitions. [2019-09-10 08:19:38,584 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 13264 transitions. Word has length 84 [2019-09-10 08:19:38,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:38,585 INFO L475 AbstractCegarLoop]: Abstraction has 9041 states and 13264 transitions. [2019-09-10 08:19:38,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 13264 transitions. [2019-09-10 08:19:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:19:38,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:38,587 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:38,587 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash 665608430, now seen corresponding path program 1 times [2019-09-10 08:19:38,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:38,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:38,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:38,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:38,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:38,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:38,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:38,915 INFO L87 Difference]: Start difference. First operand 9041 states and 13264 transitions. Second operand 8 states. [2019-09-10 08:19:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:39,144 INFO L93 Difference]: Finished difference Result 10647 states and 15635 transitions. [2019-09-10 08:19:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:39,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-10 08:19:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:39,166 INFO L225 Difference]: With dead ends: 10647 [2019-09-10 08:19:39,167 INFO L226 Difference]: Without dead ends: 10647 [2019-09-10 08:19:39,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:19:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10647 states. [2019-09-10 08:19:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10647 to 9041. [2019-09-10 08:19:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9041 states. [2019-09-10 08:19:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 13200 transitions. [2019-09-10 08:19:39,413 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 13200 transitions. Word has length 84 [2019-09-10 08:19:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:39,414 INFO L475 AbstractCegarLoop]: Abstraction has 9041 states and 13200 transitions. [2019-09-10 08:19:39,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 13200 transitions. [2019-09-10 08:19:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:19:39,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:39,415 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:39,415 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash 851756344, now seen corresponding path program 1 times [2019-09-10 08:19:39,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:39,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:39,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:39,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:39,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:39,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:39,478 INFO L87 Difference]: Start difference. First operand 9041 states and 13200 transitions. Second operand 3 states. [2019-09-10 08:19:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:39,539 INFO L93 Difference]: Finished difference Result 12885 states and 18867 transitions. [2019-09-10 08:19:39,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:39,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 08:19:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:39,570 INFO L225 Difference]: With dead ends: 12885 [2019-09-10 08:19:39,570 INFO L226 Difference]: Without dead ends: 12885 [2019-09-10 08:19:39,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12885 states. [2019-09-10 08:19:39,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12885 to 12883. [2019-09-10 08:19:39,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12883 states. [2019-09-10 08:19:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12883 states to 12883 states and 18866 transitions. [2019-09-10 08:19:39,757 INFO L78 Accepts]: Start accepts. Automaton has 12883 states and 18866 transitions. Word has length 85 [2019-09-10 08:19:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:39,757 INFO L475 AbstractCegarLoop]: Abstraction has 12883 states and 18866 transitions. [2019-09-10 08:19:39,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12883 states and 18866 transitions. [2019-09-10 08:19:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:19:39,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:39,758 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:39,759 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash -842884464, now seen corresponding path program 1 times [2019-09-10 08:19:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:39,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:39,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:39,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:19:39,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:39,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:19:39,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:19:39,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:19:39,856 INFO L87 Difference]: Start difference. First operand 12883 states and 18866 transitions. Second operand 5 states. [2019-09-10 08:19:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:40,425 INFO L93 Difference]: Finished difference Result 24069 states and 34889 transitions. [2019-09-10 08:19:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:19:40,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 08:19:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:40,469 INFO L225 Difference]: With dead ends: 24069 [2019-09-10 08:19:40,469 INFO L226 Difference]: Without dead ends: 24069 [2019-09-10 08:19:40,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:19:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24069 states. [2019-09-10 08:19:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24069 to 13331. [2019-09-10 08:19:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13331 states. [2019-09-10 08:19:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13331 states to 13331 states and 19282 transitions. [2019-09-10 08:19:40,736 INFO L78 Accepts]: Start accepts. Automaton has 13331 states and 19282 transitions. Word has length 85 [2019-09-10 08:19:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:40,737 INFO L475 AbstractCegarLoop]: Abstraction has 13331 states and 19282 transitions. [2019-09-10 08:19:40,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:19:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13331 states and 19282 transitions. [2019-09-10 08:19:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:19:40,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:40,745 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:40,745 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash 897657587, now seen corresponding path program 1 times [2019-09-10 08:19:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:40,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:40,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:40,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:40,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:40,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:40,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:19:40,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:40,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:19:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:19:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:40,827 INFO L87 Difference]: Start difference. First operand 13331 states and 19282 transitions. Second operand 3 states. [2019-09-10 08:19:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:40,861 INFO L93 Difference]: Finished difference Result 9121 states and 13256 transitions. [2019-09-10 08:19:40,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:19:40,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:19:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:40,874 INFO L225 Difference]: With dead ends: 9121 [2019-09-10 08:19:40,875 INFO L226 Difference]: Without dead ends: 9121 [2019-09-10 08:19:40,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:19:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2019-09-10 08:19:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9119. [2019-09-10 08:19:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9119 states. [2019-09-10 08:19:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9119 states to 9119 states and 13255 transitions. [2019-09-10 08:19:41,060 INFO L78 Accepts]: Start accepts. Automaton has 9119 states and 13255 transitions. Word has length 116 [2019-09-10 08:19:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:41,060 INFO L475 AbstractCegarLoop]: Abstraction has 9119 states and 13255 transitions. [2019-09-10 08:19:41,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:19:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9119 states and 13255 transitions. [2019-09-10 08:19:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:19:41,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:41,065 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:41,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash 521539718, now seen corresponding path program 1 times [2019-09-10 08:19:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:41,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:41,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:41,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:19:41,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:41,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:41,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:41,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:41,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:41,253 INFO L87 Difference]: Start difference. First operand 9119 states and 13255 transitions. Second operand 8 states. [2019-09-10 08:19:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:41,557 INFO L93 Difference]: Finished difference Result 45227 states and 65805 transitions. [2019-09-10 08:19:41,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:41,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:19:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:41,631 INFO L225 Difference]: With dead ends: 45227 [2019-09-10 08:19:41,631 INFO L226 Difference]: Without dead ends: 45227 [2019-09-10 08:19:41,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:19:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45227 states. [2019-09-10 08:19:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45227 to 15135. [2019-09-10 08:19:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15135 states. [2019-09-10 08:19:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15135 states to 15135 states and 21895 transitions. [2019-09-10 08:19:42,230 INFO L78 Accepts]: Start accepts. Automaton has 15135 states and 21895 transitions. Word has length 117 [2019-09-10 08:19:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:42,231 INFO L475 AbstractCegarLoop]: Abstraction has 15135 states and 21895 transitions. [2019-09-10 08:19:42,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15135 states and 21895 transitions. [2019-09-10 08:19:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:19:42,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:42,241 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:42,241 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:42,242 INFO L82 PathProgramCache]: Analyzing trace with hash -48478900, now seen corresponding path program 1 times [2019-09-10 08:19:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:42,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:42,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:42,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:42,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:19:42,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:42,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:42,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:42,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:42,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:42,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:42,467 INFO L87 Difference]: Start difference. First operand 15135 states and 21895 transitions. Second operand 8 states. [2019-09-10 08:19:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:42,783 INFO L93 Difference]: Finished difference Result 48235 states and 70189 transitions. [2019-09-10 08:19:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:42,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:19:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:42,857 INFO L225 Difference]: With dead ends: 48235 [2019-09-10 08:19:42,857 INFO L226 Difference]: Without dead ends: 48235 [2019-09-10 08:19:42,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:19:42,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48235 states. [2019-09-10 08:19:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48235 to 18143. [2019-09-10 08:19:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-09-10 08:19:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 26279 transitions. [2019-09-10 08:19:43,394 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 26279 transitions. Word has length 117 [2019-09-10 08:19:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:43,395 INFO L475 AbstractCegarLoop]: Abstraction has 18143 states and 26279 transitions. [2019-09-10 08:19:43,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 26279 transitions. [2019-09-10 08:19:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:19:43,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:43,405 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:43,406 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:43,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1639874962, now seen corresponding path program 1 times [2019-09-10 08:19:43,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:43,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:19:43,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:43,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:43,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:43,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:43,736 INFO L87 Difference]: Start difference. First operand 18143 states and 26279 transitions. Second operand 8 states. [2019-09-10 08:19:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:44,169 INFO L93 Difference]: Finished difference Result 39211 states and 56781 transitions. [2019-09-10 08:19:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:44,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:19:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:44,263 INFO L225 Difference]: With dead ends: 39211 [2019-09-10 08:19:44,263 INFO L226 Difference]: Without dead ends: 39211 [2019-09-10 08:19:44,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:19:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39211 states. [2019-09-10 08:19:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39211 to 24159. [2019-09-10 08:19:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24159 states. [2019-09-10 08:19:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24159 states to 24159 states and 34919 transitions. [2019-09-10 08:19:45,551 INFO L78 Accepts]: Start accepts. Automaton has 24159 states and 34919 transitions. Word has length 117 [2019-09-10 08:19:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:45,551 INFO L475 AbstractCegarLoop]: Abstraction has 24159 states and 34919 transitions. [2019-09-10 08:19:45,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 24159 states and 34919 transitions. [2019-09-10 08:19:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:19:45,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:45,558 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:45,558 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:45,559 INFO L82 PathProgramCache]: Analyzing trace with hash -346463388, now seen corresponding path program 1 times [2019-09-10 08:19:45,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:45,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:45,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:45,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:45,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:19:45,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:45,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:45,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:45,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:45,786 INFO L87 Difference]: Start difference. First operand 24159 states and 34919 transitions. Second operand 8 states. [2019-09-10 08:19:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:46,070 INFO L93 Difference]: Finished difference Result 45227 states and 65421 transitions. [2019-09-10 08:19:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:46,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:19:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:46,125 INFO L225 Difference]: With dead ends: 45227 [2019-09-10 08:19:46,125 INFO L226 Difference]: Without dead ends: 45227 [2019-09-10 08:19:46,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:19:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45227 states. [2019-09-10 08:19:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45227 to 30175. [2019-09-10 08:19:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30175 states. [2019-09-10 08:19:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30175 states to 30175 states and 43559 transitions. [2019-09-10 08:19:46,588 INFO L78 Accepts]: Start accepts. Automaton has 30175 states and 43559 transitions. Word has length 117 [2019-09-10 08:19:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:46,588 INFO L475 AbstractCegarLoop]: Abstraction has 30175 states and 43559 transitions. [2019-09-10 08:19:46,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30175 states and 43559 transitions. [2019-09-10 08:19:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:19:46,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:46,596 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:46,597 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -370208610, now seen corresponding path program 1 times [2019-09-10 08:19:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:46,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:46,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:19:46,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:46,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:46,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:46,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:46,959 INFO L87 Difference]: Start difference. First operand 30175 states and 43559 transitions. Second operand 8 states. [2019-09-10 08:19:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:47,274 INFO L93 Difference]: Finished difference Result 51243 states and 74061 transitions. [2019-09-10 08:19:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:47,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:19:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:47,335 INFO L225 Difference]: With dead ends: 51243 [2019-09-10 08:19:47,335 INFO L226 Difference]: Without dead ends: 51243 [2019-09-10 08:19:47,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:19:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51243 states. [2019-09-10 08:19:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51243 to 36191. [2019-09-10 08:19:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36191 states. [2019-09-10 08:19:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36191 states to 36191 states and 52199 transitions. [2019-09-10 08:19:47,769 INFO L78 Accepts]: Start accepts. Automaton has 36191 states and 52199 transitions. Word has length 117 [2019-09-10 08:19:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:47,770 INFO L475 AbstractCegarLoop]: Abstraction has 36191 states and 52199 transitions. [2019-09-10 08:19:47,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 36191 states and 52199 transitions. [2019-09-10 08:19:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:19:47,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:47,777 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:47,777 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:47,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash -742734504, now seen corresponding path program 1 times [2019-09-10 08:19:47,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:47,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:47,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:19:47,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:47,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:19:47,961 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:47,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:19:47,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:19:47,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:19:47,962 INFO L87 Difference]: Start difference. First operand 36191 states and 52199 transitions. Second operand 8 states. [2019-09-10 08:19:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:48,425 INFO L93 Difference]: Finished difference Result 57259 states and 82701 transitions. [2019-09-10 08:19:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:19:48,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-10 08:19:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:48,756 INFO L225 Difference]: With dead ends: 57259 [2019-09-10 08:19:48,756 INFO L226 Difference]: Without dead ends: 57259 [2019-09-10 08:19:48,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:19:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57259 states. [2019-09-10 08:19:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57259 to 42207. [2019-09-10 08:19:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42207 states. [2019-09-10 08:19:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42207 states to 42207 states and 60839 transitions. [2019-09-10 08:19:49,347 INFO L78 Accepts]: Start accepts. Automaton has 42207 states and 60839 transitions. Word has length 117 [2019-09-10 08:19:49,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:49,348 INFO L475 AbstractCegarLoop]: Abstraction has 42207 states and 60839 transitions. [2019-09-10 08:19:49,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:19:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 42207 states and 60839 transitions. [2019-09-10 08:19:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:19:49,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:49,357 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:49,358 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1924244045, now seen corresponding path program 1 times [2019-09-10 08:19:49,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:49,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:49,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:49,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:19:49,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:19:49,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 08:19:49,644 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [141], [143], [146], [154], [156], [159], [167], [169], [172], [180], [182], [185], [193], [195], [198], [206], [208], [211], [214], [218], [220], [223], [224], [226], [228], [233], [235], [238], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [301], [303], [306], [309], [311], [326], [328], [331], [334], [336], [351], [353], [356], [359], [361], [376], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:19:49,691 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:19:49,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:19:49,874 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:19:50,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:19:50,688 INFO L272 AbstractInterpreter]: Visited 109 different actions 874 times. Merged at 61 different actions 658 times. Widened at 23 different actions 85 times. Performed 3101 root evaluator evaluations with a maximum evaluation depth of 8. Performed 3101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 111 fixpoints after 23 different actions. Largest state had 153 variables. [2019-09-10 08:19:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:50,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:19:50,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:19:50,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:19:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:50,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:19:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:50,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:19:50,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:19:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:19:51,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:19:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:19:51,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:19:51,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 08:19:51,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:19:51,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:19:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:19:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:19:51,397 INFO L87 Difference]: Start difference. First operand 42207 states and 60839 transitions. Second operand 12 states. [2019-09-10 08:19:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:57,682 INFO L93 Difference]: Finished difference Result 324433 states and 453470 transitions. [2019-09-10 08:19:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 08:19:57,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-10 08:19:57,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:58,463 INFO L225 Difference]: With dead ends: 324433 [2019-09-10 08:19:58,463 INFO L226 Difference]: Without dead ends: 324433 [2019-09-10 08:19:58,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=832, Invalid=3458, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 08:19:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324433 states. [2019-09-10 08:20:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324433 to 118729. [2019-09-10 08:20:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118729 states. [2019-09-10 08:20:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118729 states to 118729 states and 165575 transitions. [2019-09-10 08:20:02,619 INFO L78 Accepts]: Start accepts. Automaton has 118729 states and 165575 transitions. Word has length 118 [2019-09-10 08:20:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:02,619 INFO L475 AbstractCegarLoop]: Abstraction has 118729 states and 165575 transitions. [2019-09-10 08:20:02,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:20:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 118729 states and 165575 transitions. [2019-09-10 08:20:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:20:02,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:02,630 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:02,630 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:02,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash 178915903, now seen corresponding path program 1 times [2019-09-10 08:20:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:02,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:02,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:02,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:02,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:02,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:02,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 08:20:02,865 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [136], [141], [143], [146], [149], [154], [156], [159], [167], [169], [172], [180], [182], [185], [193], [195], [198], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [301], [303], [306], [309], [311], [326], [328], [331], [334], [336], [344], [347], [353], [356], [359], [361], [369], [372], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:20:02,874 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:02,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:02,910 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:03,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:03,868 INFO L272 AbstractInterpreter]: Visited 111 different actions 1075 times. Merged at 64 different actions 843 times. Widened at 26 different actions 170 times. Performed 3880 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 107 fixpoints after 23 different actions. Largest state had 153 variables. [2019-09-10 08:20:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:03,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:03,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:03,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:20:03,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:03,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:20:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:04,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:20:04,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:04,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:04,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:20:05,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:20:05,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 08:20:05,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:20:05,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:20:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:20:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:05,251 INFO L87 Difference]: Start difference. First operand 118729 states and 165575 transitions. Second operand 17 states. [2019-09-10 08:20:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:13,221 INFO L93 Difference]: Finished difference Result 629914 states and 868393 transitions. [2019-09-10 08:20:13,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 08:20:13,222 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-10 08:20:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:14,144 INFO L225 Difference]: With dead ends: 629914 [2019-09-10 08:20:14,144 INFO L226 Difference]: Without dead ends: 629914 [2019-09-10 08:20:14,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=813, Invalid=2267, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:20:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629914 states. [2019-09-10 08:20:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629914 to 268204. [2019-09-10 08:20:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268204 states. [2019-09-10 08:20:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268204 states to 268204 states and 373463 transitions. [2019-09-10 08:20:22,168 INFO L78 Accepts]: Start accepts. Automaton has 268204 states and 373463 transitions. Word has length 119 [2019-09-10 08:20:22,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:22,168 INFO L475 AbstractCegarLoop]: Abstraction has 268204 states and 373463 transitions. [2019-09-10 08:20:22,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:20:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 268204 states and 373463 transitions. [2019-09-10 08:20:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:20:22,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:22,177 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:22,178 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash -515339701, now seen corresponding path program 1 times [2019-09-10 08:20:22,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:22,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:22,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:22,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:22,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:22,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:20:22,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 08:20:22,388 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [136], [141], [143], [146], [154], [156], [159], [167], [169], [172], [175], [180], [182], [185], [193], [195], [198], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [294], [297], [303], [306], [309], [311], [326], [328], [331], [334], [336], [351], [353], [356], [359], [361], [369], [372], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:20:22,391 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:20:22,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:20:22,417 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:20:23,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:20:23,063 INFO L272 AbstractInterpreter]: Visited 111 different actions 957 times. Merged at 64 different actions 739 times. Widened at 24 different actions 131 times. Performed 3368 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3368 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 87 fixpoints after 23 different actions. Largest state had 153 variables. [2019-09-10 08:20:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:23,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:20:23,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:20:23,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:20:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:23,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:20:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:23,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:20:23,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:20:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:23,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:20:24,372 WARN L188 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-09-10 08:20:24,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:20:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:20:24,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:20:24,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 08:20:24,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:20:24,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:20:24,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:20:24,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:20:24,585 INFO L87 Difference]: Start difference. First operand 268204 states and 373463 transitions. Second operand 17 states. [2019-09-10 08:20:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:36,386 INFO L93 Difference]: Finished difference Result 1218590 states and 1682719 transitions. [2019-09-10 08:20:36,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:20:36,386 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-10 08:20:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:38,210 INFO L225 Difference]: With dead ends: 1218590 [2019-09-10 08:20:38,211 INFO L226 Difference]: Without dead ends: 1218590 [2019-09-10 08:20:38,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=542, Invalid=1620, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 08:20:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218590 states. [2019-09-10 08:20:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218590 to 620226. [2019-09-10 08:20:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620226 states. [2019-09-10 08:20:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620226 states to 620226 states and 861345 transitions. [2019-09-10 08:20:54,100 INFO L78 Accepts]: Start accepts. Automaton has 620226 states and 861345 transitions. Word has length 119 [2019-09-10 08:20:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:54,100 INFO L475 AbstractCegarLoop]: Abstraction has 620226 states and 861345 transitions. [2019-09-10 08:20:54,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:20:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 620226 states and 861345 transitions. [2019-09-10 08:20:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:20:54,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:54,113 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:54,113 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1117029783, now seen corresponding path program 1 times [2019-09-10 08:20:54,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:01,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:01,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:01,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:21:01,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:01,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:01,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:01,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:01,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:01,073 INFO L87 Difference]: Start difference. First operand 620226 states and 861345 transitions. Second operand 3 states. [2019-09-10 08:21:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:02,266 INFO L93 Difference]: Finished difference Result 533082 states and 735664 transitions. [2019-09-10 08:21:02,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:02,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:21:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:03,001 INFO L225 Difference]: With dead ends: 533082 [2019-09-10 08:21:03,001 INFO L226 Difference]: Without dead ends: 533082 [2019-09-10 08:21:03,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533082 states. [2019-09-10 08:21:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533082 to 533082. [2019-09-10 08:21:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533082 states. [2019-09-10 08:21:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533082 states to 533082 states and 735664 transitions. [2019-09-10 08:21:20,094 INFO L78 Accepts]: Start accepts. Automaton has 533082 states and 735664 transitions. Word has length 120 [2019-09-10 08:21:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:20,094 INFO L475 AbstractCegarLoop]: Abstraction has 533082 states and 735664 transitions. [2019-09-10 08:21:20,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 533082 states and 735664 transitions. [2019-09-10 08:21:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:21:20,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:20,103 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:20,103 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 122279259, now seen corresponding path program 1 times [2019-09-10 08:21:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:20,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:20,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:20,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:20,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:21:20,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:20,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:21:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:21:20,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:20,173 INFO L87 Difference]: Start difference. First operand 533082 states and 735664 transitions. Second operand 3 states. [2019-09-10 08:21:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:20,887 INFO L93 Difference]: Finished difference Result 304431 states and 415028 transitions. [2019-09-10 08:21:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:21:20,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:21:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:21,228 INFO L225 Difference]: With dead ends: 304431 [2019-09-10 08:21:21,229 INFO L226 Difference]: Without dead ends: 304431 [2019-09-10 08:21:21,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:21:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304431 states. [2019-09-10 08:21:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304431 to 304429. [2019-09-10 08:21:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304429 states. [2019-09-10 08:21:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304429 states to 304429 states and 415027 transitions. [2019-09-10 08:21:30,867 INFO L78 Accepts]: Start accepts. Automaton has 304429 states and 415027 transitions. Word has length 120 [2019-09-10 08:21:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:30,868 INFO L475 AbstractCegarLoop]: Abstraction has 304429 states and 415027 transitions. [2019-09-10 08:21:30,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:21:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 304429 states and 415027 transitions. [2019-09-10 08:21:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:21:30,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:30,873 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:30,873 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2018359013, now seen corresponding path program 1 times [2019-09-10 08:21:30,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:30,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:30,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:31,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:21:31,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:21:31,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2019-09-10 08:21:31,106 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [136], [141], [143], [146], [149], [152], [154], [156], [159], [167], [169], [172], [175], [180], [182], [185], [193], [195], [198], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [251], [253], [256], [259], [261], [276], [278], [281], [284], [286], [294], [297], [303], [306], [309], [311], [326], [328], [331], [334], [336], [353], [356], [359], [361], [369], [372], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:21:31,109 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:21:31,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:21:31,133 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:21:31,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:21:31,696 INFO L272 AbstractInterpreter]: Visited 112 different actions 957 times. Merged at 65 different actions 744 times. Widened at 22 different actions 120 times. Performed 3273 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 87 fixpoints after 24 different actions. Largest state had 153 variables. [2019-09-10 08:21:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:31,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:21:31,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:21:31,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:21:31,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:31,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:21:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:31,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 08:21:31,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:21:32,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:21:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:21:32,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:21:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-09-10 08:21:32,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:21:32,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 08:21:32,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:21:32,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:21:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:21:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:21:32,934 INFO L87 Difference]: Start difference. First operand 304429 states and 415027 transitions. Second operand 20 states. [2019-09-10 08:21:35,126 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:21:35,394 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:21:38,432 WARN L188 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 08:21:40,806 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:21:41,570 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:41,776 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:21:42,423 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:21:42,694 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:21:43,898 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:45,894 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:21:47,309 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:47,609 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:21:47,783 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-10 08:21:48,214 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:21:48,849 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:21:49,331 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:21:49,516 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:21:50,049 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:21:50,810 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:50,949 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 08:21:51,664 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:21:52,105 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:21:52,658 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-09-10 08:21:52,829 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:21:53,636 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-10 08:21:58,557 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:21:59,130 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:22:00,079 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:22:01,570 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-10 08:22:02,939 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:22:03,234 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 08:22:03,664 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 08:22:04,886 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 08:22:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:12,045 INFO L93 Difference]: Finished difference Result 2360942 states and 3178199 transitions. [2019-09-10 08:22:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2019-09-10 08:22:12,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2019-09-10 08:22:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:26,120 INFO L225 Difference]: With dead ends: 2360942 [2019-09-10 08:22:26,121 INFO L226 Difference]: Without dead ends: 2360942 [2019-09-10 08:22:26,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27400 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=8594, Invalid=57712, Unknown=0, NotChecked=0, Total=66306 [2019-09-10 08:22:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360942 states. [2019-09-10 08:22:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360942 to 690781. [2019-09-10 08:22:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690781 states. [2019-09-10 08:22:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690781 states to 690781 states and 940935 transitions. [2019-09-10 08:22:56,329 INFO L78 Accepts]: Start accepts. Automaton has 690781 states and 940935 transitions. Word has length 120 [2019-09-10 08:22:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:56,329 INFO L475 AbstractCegarLoop]: Abstraction has 690781 states and 940935 transitions. [2019-09-10 08:22:56,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:22:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 690781 states and 940935 transitions. [2019-09-10 08:22:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:22:56,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:56,339 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:56,340 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1335646458, now seen corresponding path program 1 times [2019-09-10 08:22:56,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:56,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:56,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:22:56,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:56,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:56,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:56,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:56,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:56,414 INFO L87 Difference]: Start difference. First operand 690781 states and 940935 transitions. Second operand 3 states. [2019-09-10 08:23:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:00,321 INFO L93 Difference]: Finished difference Result 590272 states and 798884 transitions. [2019-09-10 08:23:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:23:00,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:23:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:01,076 INFO L225 Difference]: With dead ends: 590272 [2019-09-10 08:23:01,076 INFO L226 Difference]: Without dead ends: 590272 [2019-09-10 08:23:01,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:23:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590272 states. [2019-09-10 08:23:21,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590272 to 590272. [2019-09-10 08:23:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590272 states. [2019-09-10 08:23:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590272 states to 590272 states and 798884 transitions. [2019-09-10 08:23:23,238 INFO L78 Accepts]: Start accepts. Automaton has 590272 states and 798884 transitions. Word has length 121 [2019-09-10 08:23:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:23,239 INFO L475 AbstractCegarLoop]: Abstraction has 590272 states and 798884 transitions. [2019-09-10 08:23:23,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:23:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 590272 states and 798884 transitions. [2019-09-10 08:23:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:23:23,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:23,248 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:23,248 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:23,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2135669582, now seen corresponding path program 1 times [2019-09-10 08:23:23,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:23,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:23,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:23,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:23,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:23,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 122 with the following transitions: [2019-09-10 08:23:23,503 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [136], [139], [141], [143], [146], [149], [152], [154], [156], [159], [167], [169], [172], [175], [180], [182], [185], [193], [195], [198], [201], [206], [208], [211], [218], [220], [223], [224], [226], [235], [238], [242], [244], [247], [253], [256], [259], [261], [276], [278], [281], [284], [286], [294], [297], [303], [306], [309], [311], [326], [328], [331], [334], [336], [353], [356], [359], [361], [378], [380], [383], [386], [388], [438], [439], [443], [444], [445] [2019-09-10 08:23:23,506 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:23,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:23,538 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:24,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:24,090 INFO L272 AbstractInterpreter]: Visited 113 different actions 989 times. Merged at 66 different actions 771 times. Widened at 21 different actions 103 times. Performed 3419 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3419 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 87 fixpoints after 21 different actions. Largest state had 153 variables. [2019-09-10 08:23:24,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:24,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:24,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:24,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:24,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:24,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:23:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:24,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:23:24,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:24,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:24,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:24,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:25,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:23:25,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:23:25,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:23:25,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:23:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:23:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:23:25,032 INFO L87 Difference]: Start difference. First operand 590272 states and 798884 transitions. Second operand 17 states. [2019-09-10 08:23:40,953 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 29 DAG size of output: 21