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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:46,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:46,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:46,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:46,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:46,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:46,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:46,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:46,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:46,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:46,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:46,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:46,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:46,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:46,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:46,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:46,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:46,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:46,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:46,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:46,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:46,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:46,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:46,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:46,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:46,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:46,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:47,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:47,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:47,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:47,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:47,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:47,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:47,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:47,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:47,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:47,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:47,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:47,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:47,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:47,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:47,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:47,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:47,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:47,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:47,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:47,034 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:47,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:47,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:47,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:47,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:47,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:47,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:47,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:47,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:47,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:47,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:47,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:47,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:47,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:47,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:47,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:47,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:47,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:47,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:47,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:47,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:47,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:47,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:47,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:47,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:47,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:47,367 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:47,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:47,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:47,375 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:47,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:47,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13ac99d5/6bf99d870cfd48bfb767b6f6cffb5b65/FLAG88b9a779d [2019-10-15 01:23:48,120 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:48,121 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:48,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13ac99d5/6bf99d870cfd48bfb767b6f6cffb5b65/FLAG88b9a779d [2019-10-15 01:23:48,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e13ac99d5/6bf99d870cfd48bfb767b6f6cffb5b65 [2019-10-15 01:23:48,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:48,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:48,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:48,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:48,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:48,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:48" (1/1) ... [2019-10-15 01:23:48,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49596568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:48, skipping insertion in model container [2019-10-15 01:23:48,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:48" (1/1) ... [2019-10-15 01:23:48,329 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:48,414 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:49,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:49,174 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:49,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:49,632 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:49,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49 WrapperNode [2019-10-15 01:23:49,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:49,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:49,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:49,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:49,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (1/1) ... [2019-10-15 01:23:49,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:49,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:49,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:49,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:49,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (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-10-15 01:23:49,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:49,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:49,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:49,838 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:49,838 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:49,838 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:49,838 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:49,838 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:49,838 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:49,839 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:49,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:49,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:49,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:51,604 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:51,604 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:51,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:51 BoogieIcfgContainer [2019-10-15 01:23:51,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:51,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:51,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:51,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:51,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:48" (1/3) ... [2019-10-15 01:23:51,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569a024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:51, skipping insertion in model container [2019-10-15 01:23:51,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:49" (2/3) ... [2019-10-15 01:23:51,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569a024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:51, skipping insertion in model container [2019-10-15 01:23:51,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:51" (3/3) ... [2019-10-15 01:23:51,624 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:51,638 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:51,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 01:23:51,664 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 01:23:51,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:51,714 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:51,714 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:51,714 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:51,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:51,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:51,715 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:51,715 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-10-15 01:23:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:23:51,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:51,798 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:51,800 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash 598173108, now seen corresponding path program 1 times [2019-10-15 01:23:51,818 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:51,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853365169] [2019-10-15 01:23:51,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:51,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:52,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853365169] [2019-10-15 01:23:52,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:52,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:52,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364071546] [2019-10-15 01:23:52,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:52,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:52,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:52,955 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-10-15 01:23:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,232 INFO L93 Difference]: Finished difference Result 1245 states and 2212 transitions. [2019-10-15 01:23:53,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:53,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-15 01:23:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,267 INFO L225 Difference]: With dead ends: 1245 [2019-10-15 01:23:53,268 INFO L226 Difference]: Without dead ends: 821 [2019-10-15 01:23:53,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-10-15 01:23:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 794. [2019-10-15 01:23:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-10-15 01:23:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1136 transitions. [2019-10-15 01:23:53,447 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1136 transitions. Word has length 154 [2019-10-15 01:23:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,448 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1136 transitions. [2019-10-15 01:23:53,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:53,448 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1136 transitions. [2019-10-15 01:23:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-15 01:23:53,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,451 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:53,452 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1172332246, now seen corresponding path program 1 times [2019-10-15 01:23:53,453 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79801430] [2019-10-15 01:23:53,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,453 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:53,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79801430] [2019-10-15 01:23:53,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95111336] [2019-10-15 01:23:53,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,613 INFO L87 Difference]: Start difference. First operand 794 states and 1136 transitions. Second operand 3 states. [2019-10-15 01:23:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:53,693 INFO L93 Difference]: Finished difference Result 2336 states and 3338 transitions. [2019-10-15 01:23:53,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:53,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-15 01:23:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:53,704 INFO L225 Difference]: With dead ends: 2336 [2019-10-15 01:23:53,704 INFO L226 Difference]: Without dead ends: 1574 [2019-10-15 01:23:53,707 INFO L600 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-10-15 01:23:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-10-15 01:23:53,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 796. [2019-10-15 01:23:53,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-10-15 01:23:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1138 transitions. [2019-10-15 01:23:53,759 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1138 transitions. Word has length 155 [2019-10-15 01:23:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:53,760 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1138 transitions. [2019-10-15 01:23:53,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1138 transitions. [2019-10-15 01:23:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:53,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:53,763 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:53,764 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:53,764 INFO L82 PathProgramCache]: Analyzing trace with hash 501625459, now seen corresponding path program 1 times [2019-10-15 01:23:53,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:53,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624096309] [2019-10-15 01:23:53,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:53,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:53,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624096309] [2019-10-15 01:23:53,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:53,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:53,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865636310] [2019-10-15 01:23:53,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:53,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:53,916 INFO L87 Difference]: Start difference. First operand 796 states and 1138 transitions. Second operand 3 states. [2019-10-15 01:23:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,174 INFO L93 Difference]: Finished difference Result 2139 states and 3061 transitions. [2019-10-15 01:23:54,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:54,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 01:23:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:54,187 INFO L225 Difference]: With dead ends: 2139 [2019-10-15 01:23:54,188 INFO L226 Difference]: Without dead ends: 1540 [2019-10-15 01:23:54,191 INFO L600 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-10-15 01:23:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-10-15 01:23:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1513. [2019-10-15 01:23:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-10-15 01:23:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2153 transitions. [2019-10-15 01:23:54,303 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2153 transitions. Word has length 156 [2019-10-15 01:23:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:54,304 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2153 transitions. [2019-10-15 01:23:54,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2153 transitions. [2019-10-15 01:23:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:23:54,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:54,310 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:54,310 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash 104654224, now seen corresponding path program 1 times [2019-10-15 01:23:54,312 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:54,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786136634] [2019-10-15 01:23:54,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:54,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786136634] [2019-10-15 01:23:54,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:23:54,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598994] [2019-10-15 01:23:54,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:23:54,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:23:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:23:54,552 INFO L87 Difference]: Start difference. First operand 1513 states and 2153 transitions. Second operand 4 states. [2019-10-15 01:23:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,637 INFO L93 Difference]: Finished difference Result 2489 states and 3549 transitions. [2019-10-15 01:23:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:23:54,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-15 01:23:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:54,644 INFO L225 Difference]: With dead ends: 2489 [2019-10-15 01:23:54,644 INFO L226 Difference]: Without dead ends: 1161 [2019-10-15 01:23:54,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-10-15 01:23:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2019-10-15 01:23:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-10-15 01:23:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1645 transitions. [2019-10-15 01:23:54,707 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1645 transitions. Word has length 156 [2019-10-15 01:23:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:54,708 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 1645 transitions. [2019-10-15 01:23:54,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:23:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1645 transitions. [2019-10-15 01:23:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-15 01:23:54,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:54,711 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:54,712 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:54,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1233167963, now seen corresponding path program 1 times [2019-10-15 01:23:54,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:54,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164169310] [2019-10-15 01:23:54,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:54,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:54,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164169310] [2019-10-15 01:23:54,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:54,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:54,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998310557] [2019-10-15 01:23:54,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:54,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:54,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:54,849 INFO L87 Difference]: Start difference. First operand 1161 states and 1645 transitions. Second operand 3 states. [2019-10-15 01:23:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:54,988 INFO L93 Difference]: Finished difference Result 2522 states and 3657 transitions. [2019-10-15 01:23:54,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:54,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-15 01:23:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,000 INFO L225 Difference]: With dead ends: 2522 [2019-10-15 01:23:55,000 INFO L226 Difference]: Without dead ends: 1547 [2019-10-15 01:23:55,003 INFO L600 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-10-15 01:23:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-10-15 01:23:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1382. [2019-10-15 01:23:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-15 01:23:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2003 transitions. [2019-10-15 01:23:55,105 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2003 transitions. Word has length 158 [2019-10-15 01:23:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,106 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 2003 transitions. [2019-10-15 01:23:55,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2003 transitions. [2019-10-15 01:23:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-15 01:23:55,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,112 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:55,112 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash -866694497, now seen corresponding path program 1 times [2019-10-15 01:23:55,113 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354398582] [2019-10-15 01:23:55,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:55,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354398582] [2019-10-15 01:23:55,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:55,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:55,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285271734] [2019-10-15 01:23:55,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:55,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:55,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:55,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:55,261 INFO L87 Difference]: Start difference. First operand 1382 states and 2003 transitions. Second operand 3 states. [2019-10-15 01:23:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:55,489 INFO L93 Difference]: Finished difference Result 3110 states and 4621 transitions. [2019-10-15 01:23:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:55,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-15 01:23:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:55,503 INFO L225 Difference]: With dead ends: 3110 [2019-10-15 01:23:55,504 INFO L226 Difference]: Without dead ends: 1998 [2019-10-15 01:23:55,508 INFO L600 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-10-15 01:23:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-10-15 01:23:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1771. [2019-10-15 01:23:55,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-15 01:23:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2632 transitions. [2019-10-15 01:23:55,719 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2632 transitions. Word has length 160 [2019-10-15 01:23:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:55,719 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2632 transitions. [2019-10-15 01:23:55,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2632 transitions. [2019-10-15 01:23:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:23:55,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:55,723 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:23:55,723 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:55,724 INFO L82 PathProgramCache]: Analyzing trace with hash 753095009, now seen corresponding path program 1 times [2019-10-15 01:23:55,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:55,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761410303] [2019-10-15 01:23:55,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:55,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:56,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761410303] [2019-10-15 01:23:56,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:56,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 01:23:56,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946290448] [2019-10-15 01:23:56,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 01:23:56,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 01:23:56,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:23:56,137 INFO L87 Difference]: Start difference. First operand 1771 states and 2632 transitions. Second operand 13 states. [2019-10-15 01:24:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:01,079 INFO L93 Difference]: Finished difference Result 14490 states and 22590 transitions. [2019-10-15 01:24:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-15 01:24:01,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-10-15 01:24:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:01,151 INFO L225 Difference]: With dead ends: 14490 [2019-10-15 01:24:01,151 INFO L226 Difference]: Without dead ends: 12938 [2019-10-15 01:24:01,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 01:24:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2019-10-15 01:24:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 7935. [2019-10-15 01:24:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-10-15 01:24:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 12108 transitions. [2019-10-15 01:24:01,854 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 12108 transitions. Word has length 161 [2019-10-15 01:24:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:01,856 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 12108 transitions. [2019-10-15 01:24:01,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 01:24:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 12108 transitions. [2019-10-15 01:24:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:01,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:01,865 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:01,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1464453224, now seen corresponding path program 1 times [2019-10-15 01:24:01,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:01,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883560125] [2019-10-15 01:24:01,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:01,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:02,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883560125] [2019-10-15 01:24:02,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:02,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:02,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051579082] [2019-10-15 01:24:02,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:02,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:02,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:02,166 INFO L87 Difference]: Start difference. First operand 7935 states and 12108 transitions. Second operand 9 states. [2019-10-15 01:24:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:03,240 INFO L93 Difference]: Finished difference Result 11115 states and 17157 transitions. [2019-10-15 01:24:03,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:24:03,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-10-15 01:24:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:03,262 INFO L225 Difference]: With dead ends: 11115 [2019-10-15 01:24:03,262 INFO L226 Difference]: Without dead ends: 3905 [2019-10-15 01:24:03,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:24:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-10-15 01:24:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2924. [2019-10-15 01:24:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-10-15 01:24:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4420 transitions. [2019-10-15 01:24:03,496 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4420 transitions. Word has length 161 [2019-10-15 01:24:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:03,497 INFO L462 AbstractCegarLoop]: Abstraction has 2924 states and 4420 transitions. [2019-10-15 01:24:03,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4420 transitions. [2019-10-15 01:24:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:03,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:03,501 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:03,502 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:03,502 INFO L82 PathProgramCache]: Analyzing trace with hash -217483962, now seen corresponding path program 1 times [2019-10-15 01:24:03,502 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:03,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071066074] [2019-10-15 01:24:03,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:03,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:03,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071066074] [2019-10-15 01:24:03,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:03,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:24:03,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129454357] [2019-10-15 01:24:03,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:24:03,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:03,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:24:03,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:24:03,738 INFO L87 Difference]: Start difference. First operand 2924 states and 4420 transitions. Second operand 9 states. [2019-10-15 01:24:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:05,500 INFO L93 Difference]: Finished difference Result 14166 states and 21917 transitions. [2019-10-15 01:24:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:24:05,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-10-15 01:24:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:05,539 INFO L225 Difference]: With dead ends: 14166 [2019-10-15 01:24:05,540 INFO L226 Difference]: Without dead ends: 11461 [2019-10-15 01:24:05,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:24:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-15 01:24:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7578. [2019-10-15 01:24:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7578 states. [2019-10-15 01:24:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11480 transitions. [2019-10-15 01:24:06,188 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11480 transitions. Word has length 161 [2019-10-15 01:24:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:06,189 INFO L462 AbstractCegarLoop]: Abstraction has 7578 states and 11480 transitions. [2019-10-15 01:24:06,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:24:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11480 transitions. [2019-10-15 01:24:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:06,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:06,196 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:06,196 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:06,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1859935101, now seen corresponding path program 1 times [2019-10-15 01:24:06,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:06,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127672607] [2019-10-15 01:24:06,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:06,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:06,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127672607] [2019-10-15 01:24:06,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:06,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:06,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045793035] [2019-10-15 01:24:06,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:06,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:06,363 INFO L87 Difference]: Start difference. First operand 7578 states and 11480 transitions. Second operand 4 states. [2019-10-15 01:24:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:07,536 INFO L93 Difference]: Finished difference Result 14483 states and 22537 transitions. [2019-10-15 01:24:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:07,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:24:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:07,570 INFO L225 Difference]: With dead ends: 14483 [2019-10-15 01:24:07,570 INFO L226 Difference]: Without dead ends: 9190 [2019-10-15 01:24:07,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2019-10-15 01:24:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 9188. [2019-10-15 01:24:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-10-15 01:24:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 14008 transitions. [2019-10-15 01:24:08,371 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 14008 transitions. Word has length 161 [2019-10-15 01:24:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:08,372 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 14008 transitions. [2019-10-15 01:24:08,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 14008 transitions. [2019-10-15 01:24:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-15 01:24:08,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:08,383 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:08,383 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1831416783, now seen corresponding path program 1 times [2019-10-15 01:24:08,384 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:08,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40950225] [2019-10-15 01:24:08,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:08,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:08,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:08,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40950225] [2019-10-15 01:24:08,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:08,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:08,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190342073] [2019-10-15 01:24:08,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:08,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:08,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:08,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:08,817 INFO L87 Difference]: Start difference. First operand 9188 states and 14008 transitions. Second operand 4 states. [2019-10-15 01:24:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:09,896 INFO L93 Difference]: Finished difference Result 24236 states and 36925 transitions. [2019-10-15 01:24:09,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:09,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-15 01:24:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:09,930 INFO L225 Difference]: With dead ends: 24236 [2019-10-15 01:24:09,931 INFO L226 Difference]: Without dead ends: 15071 [2019-10-15 01:24:09,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:09,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-10-15 01:24:10,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15048. [2019-10-15 01:24:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15048 states. [2019-10-15 01:24:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15048 states to 15048 states and 22725 transitions. [2019-10-15 01:24:10,781 INFO L78 Accepts]: Start accepts. Automaton has 15048 states and 22725 transitions. Word has length 161 [2019-10-15 01:24:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:10,781 INFO L462 AbstractCegarLoop]: Abstraction has 15048 states and 22725 transitions. [2019-10-15 01:24:10,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 15048 states and 22725 transitions. [2019-10-15 01:24:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:24:10,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:10,792 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:10,793 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash 668472032, now seen corresponding path program 1 times [2019-10-15 01:24:10,794 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:10,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873572881] [2019-10-15 01:24:10,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,794 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:10,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:10,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873572881] [2019-10-15 01:24:10,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:10,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:10,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075898632] [2019-10-15 01:24:10,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:10,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:10,937 INFO L87 Difference]: Start difference. First operand 15048 states and 22725 transitions. Second operand 3 states. [2019-10-15 01:24:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:12,365 INFO L93 Difference]: Finished difference Result 43634 states and 66065 transitions. [2019-10-15 01:24:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:12,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-15 01:24:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:12,425 INFO L225 Difference]: With dead ends: 43634 [2019-10-15 01:24:12,425 INFO L226 Difference]: Without dead ends: 28974 [2019-10-15 01:24:12,457 INFO L600 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-10-15 01:24:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28974 states. [2019-10-15 01:24:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28974 to 28953. [2019-10-15 01:24:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28953 states. [2019-10-15 01:24:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28953 states to 28953 states and 43506 transitions. [2019-10-15 01:24:14,186 INFO L78 Accepts]: Start accepts. Automaton has 28953 states and 43506 transitions. Word has length 163 [2019-10-15 01:24:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:14,187 INFO L462 AbstractCegarLoop]: Abstraction has 28953 states and 43506 transitions. [2019-10-15 01:24:14,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:24:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 28953 states and 43506 transitions. [2019-10-15 01:24:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:24:14,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:14,204 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:14,205 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1439315485, now seen corresponding path program 1 times [2019-10-15 01:24:14,205 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:14,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101468672] [2019-10-15 01:24:14,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,206 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:14,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:14,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101468672] [2019-10-15 01:24:14,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:14,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:24:14,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242910749] [2019-10-15 01:24:14,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:24:14,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:24:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:24:14,358 INFO L87 Difference]: Start difference. First operand 28953 states and 43506 transitions. Second operand 4 states. [2019-10-15 01:24:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:15,929 INFO L93 Difference]: Finished difference Result 46825 states and 70222 transitions. [2019-10-15 01:24:15,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:24:15,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-15 01:24:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:15,978 INFO L225 Difference]: With dead ends: 46825 [2019-10-15 01:24:15,979 INFO L226 Difference]: Without dead ends: 23474 [2019-10-15 01:24:16,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:24:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23474 states. [2019-10-15 01:24:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23474 to 23474. [2019-10-15 01:24:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23474 states. [2019-10-15 01:24:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23474 states to 23474 states and 35144 transitions. [2019-10-15 01:24:17,463 INFO L78 Accepts]: Start accepts. Automaton has 23474 states and 35144 transitions. Word has length 163 [2019-10-15 01:24:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:24:17,463 INFO L462 AbstractCegarLoop]: Abstraction has 23474 states and 35144 transitions. [2019-10-15 01:24:17,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:24:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 23474 states and 35144 transitions. [2019-10-15 01:24:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-15 01:24:17,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:24:17,473 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 01:24:17,473 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:24:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:24:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1713355484, now seen corresponding path program 1 times [2019-10-15 01:24:17,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:24:17,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180077509] [2019-10-15 01:24:17,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:17,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:24:17,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:24:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:24:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:24:17,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180077509] [2019-10-15 01:24:17,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:24:17,556 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:24:17,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039913312] [2019-10-15 01:24:17,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:24:17,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:24:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:24:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:24:17,558 INFO L87 Difference]: Start difference. First operand 23474 states and 35144 transitions. Second operand 3 states. [2019-10-15 01:24:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:24:19,797 INFO L93 Difference]: Finished difference Result 62336 states and 94477 transitions. [2019-10-15 01:24:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:24:19,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-15 01:24:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:24:19,842 INFO L225 Difference]: With dead ends: 62336 [2019-10-15 01:24:19,842 INFO L226 Difference]: Without dead ends: 39198 [2019-10-15 01:24:19,865 INFO L600 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-10-15 01:24:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39198 states.