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-f4eb214f-m [2019-10-13 21:24:43,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:43,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:43,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:43,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:43,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:43,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:43,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:43,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:43,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:43,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:43,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:43,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:43,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:43,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:43,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:43,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:43,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:43,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:43,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:43,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:43,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:43,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:43,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:43,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:43,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:43,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:43,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:43,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:43,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:43,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:43,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:43,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:43,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:43,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:43,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:43,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:43,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:43,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:43,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:43,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:43,778 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-13 21:24:43,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:43,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:43,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:43,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:43,794 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:43,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:43,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:43,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:43,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:43,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:43,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:43,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:43,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:43,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:43,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:43,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:43,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:43,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:43,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:43,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:43,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:43,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:43,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:43,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:43,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:43,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:43,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:43,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:43,799 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-13 21:24:44,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:44,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:44,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:44,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:44,111 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:44,112 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-13 21:24:44,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84ab6ffd0/ec54220b5f884b8fac96fbbec38ec344/FLAG9288093b1 [2019-10-13 21:24:44,742 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:44,746 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-13 21:24:44,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84ab6ffd0/ec54220b5f884b8fac96fbbec38ec344/FLAG9288093b1 [2019-10-13 21:24:45,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84ab6ffd0/ec54220b5f884b8fac96fbbec38ec344 [2019-10-13 21:24:45,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:45,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:45,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:45,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:45,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:45,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64145083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:45, skipping insertion in model container [2019-10-13 21:24:45,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:45" (1/1) ... [2019-10-13 21:24:45,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:45,162 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:45,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:45,884 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:46,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:46,127 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:46,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46 WrapperNode [2019-10-13 21:24:46,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:46,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:46,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:46,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:46,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (1/1) ... [2019-10-13 21:24:46,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:46,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:46,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:46,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:46,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (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-13 21:24:46,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:46,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:46,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:48,231 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:48,232 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:48,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:48 BoogieIcfgContainer [2019-10-13 21:24:48,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:48,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:48,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:48,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:48,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:45" (1/3) ... [2019-10-13 21:24:48,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c185f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:48, skipping insertion in model container [2019-10-13 21:24:48,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46" (2/3) ... [2019-10-13 21:24:48,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c185f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:48, skipping insertion in model container [2019-10-13 21:24:48,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:48" (3/3) ... [2019-10-13 21:24:48,243 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:48,253 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:48,261 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 21:24:48,273 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 21:24:48,304 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:48,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:48,305 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:48,305 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:48,305 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:48,305 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:48,305 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:48,306 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states. [2019-10-13 21:24:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 21:24:48,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,355 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-13 21:24:48,357 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash 598173108, now seen corresponding path program 1 times [2019-10-13 21:24:48,373 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960084304] [2019-10-13 21:24:48,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,380 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-13 21:24:49,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960084304] [2019-10-13 21:24:49,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:49,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985107599] [2019-10-13 21:24:49,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:49,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:49,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:49,407 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 4 states. [2019-10-13 21:24:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:49,645 INFO L93 Difference]: Finished difference Result 1245 states and 2212 transitions. [2019-10-13 21:24:49,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:49,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-13 21:24:49,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:49,670 INFO L225 Difference]: With dead ends: 1245 [2019-10-13 21:24:49,671 INFO L226 Difference]: Without dead ends: 821 [2019-10-13 21:24:49,678 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-13 21:24:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2019-10-13 21:24:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 794. [2019-10-13 21:24:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-10-13 21:24:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1136 transitions. [2019-10-13 21:24:49,803 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1136 transitions. Word has length 154 [2019-10-13 21:24:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:49,804 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1136 transitions. [2019-10-13 21:24:49,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1136 transitions. [2019-10-13 21:24:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:24:49,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:49,818 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-13 21:24:49,819 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:49,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:49,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1172332246, now seen corresponding path program 1 times [2019-10-13 21:24:49,820 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:49,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853463292] [2019-10-13 21:24:49,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:49,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,007 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-13 21:24:50,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853463292] [2019-10-13 21:24:50,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457102384] [2019-10-13 21:24:50,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,013 INFO L87 Difference]: Start difference. First operand 794 states and 1136 transitions. Second operand 3 states. [2019-10-13 21:24:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,085 INFO L93 Difference]: Finished difference Result 2336 states and 3338 transitions. [2019-10-13 21:24:50,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-13 21:24:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,095 INFO L225 Difference]: With dead ends: 2336 [2019-10-13 21:24:50,095 INFO L226 Difference]: Without dead ends: 1574 [2019-10-13 21:24:50,098 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-13 21:24:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-10-13 21:24:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 796. [2019-10-13 21:24:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-10-13 21:24:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1138 transitions. [2019-10-13 21:24:50,142 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1138 transitions. Word has length 155 [2019-10-13 21:24:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,142 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1138 transitions. [2019-10-13 21:24:50,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1138 transitions. [2019-10-13 21:24:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:50,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,145 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-13 21:24:50,146 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash 501625459, now seen corresponding path program 1 times [2019-10-13 21:24:50,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998251289] [2019-10-13 21:24:50,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,291 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-13 21:24:50,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998251289] [2019-10-13 21:24:50,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:50,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454761873] [2019-10-13 21:24:50,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:50,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:50,307 INFO L87 Difference]: Start difference. First operand 796 states and 1138 transitions. Second operand 3 states. [2019-10-13 21:24:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,463 INFO L93 Difference]: Finished difference Result 2139 states and 3061 transitions. [2019-10-13 21:24:50,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:50,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 21:24:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,476 INFO L225 Difference]: With dead ends: 2139 [2019-10-13 21:24:50,477 INFO L226 Difference]: Without dead ends: 1540 [2019-10-13 21:24:50,481 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-13 21:24:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-10-13 21:24:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1513. [2019-10-13 21:24:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-10-13 21:24:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2153 transitions. [2019-10-13 21:24:50,583 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2153 transitions. Word has length 156 [2019-10-13 21:24:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,584 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 2153 transitions. [2019-10-13 21:24:50,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2153 transitions. [2019-10-13 21:24:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:24:50,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,591 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-13 21:24:50,591 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 104654224, now seen corresponding path program 1 times [2019-10-13 21:24:50,592 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418824962] [2019-10-13 21:24:50,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:50,983 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-13 21:24:50,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418824962] [2019-10-13 21:24:50,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:50,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:50,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839303874] [2019-10-13 21:24:50,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:50,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:50,987 INFO L87 Difference]: Start difference. First operand 1513 states and 2153 transitions. Second operand 4 states. [2019-10-13 21:24:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,096 INFO L93 Difference]: Finished difference Result 2489 states and 3549 transitions. [2019-10-13 21:24:51,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:51,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-13 21:24:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,105 INFO L225 Difference]: With dead ends: 2489 [2019-10-13 21:24:51,105 INFO L226 Difference]: Without dead ends: 1161 [2019-10-13 21:24:51,109 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-13 21:24:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2019-10-13 21:24:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2019-10-13 21:24:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-10-13 21:24:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1645 transitions. [2019-10-13 21:24:51,181 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1645 transitions. Word has length 156 [2019-10-13 21:24:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,182 INFO L462 AbstractCegarLoop]: Abstraction has 1161 states and 1645 transitions. [2019-10-13 21:24:51,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1645 transitions. [2019-10-13 21:24:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:24:51,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,186 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-13 21:24:51,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1233167963, now seen corresponding path program 1 times [2019-10-13 21:24:51,187 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770267377] [2019-10-13 21:24:51,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,293 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-13 21:24:51,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770267377] [2019-10-13 21:24:51,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959648809] [2019-10-13 21:24:51,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,297 INFO L87 Difference]: Start difference. First operand 1161 states and 1645 transitions. Second operand 3 states. [2019-10-13 21:24:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,417 INFO L93 Difference]: Finished difference Result 2522 states and 3657 transitions. [2019-10-13 21:24:51,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-13 21:24:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,426 INFO L225 Difference]: With dead ends: 2522 [2019-10-13 21:24:51,427 INFO L226 Difference]: Without dead ends: 1547 [2019-10-13 21:24:51,429 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-13 21:24:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2019-10-13 21:24:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1382. [2019-10-13 21:24:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-10-13 21:24:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2003 transitions. [2019-10-13 21:24:51,519 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2003 transitions. Word has length 158 [2019-10-13 21:24:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,519 INFO L462 AbstractCegarLoop]: Abstraction has 1382 states and 2003 transitions. [2019-10-13 21:24:51,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2003 transitions. [2019-10-13 21:24:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:24:51,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,523 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-13 21:24:51,552 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash -866694497, now seen corresponding path program 1 times [2019-10-13 21:24:51,553 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562833189] [2019-10-13 21:24:51,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,554 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,664 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-13 21:24:51,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562833189] [2019-10-13 21:24:51,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:51,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430672792] [2019-10-13 21:24:51,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:51,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:51,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:51,667 INFO L87 Difference]: Start difference. First operand 1382 states and 2003 transitions. Second operand 3 states. [2019-10-13 21:24:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,827 INFO L93 Difference]: Finished difference Result 3110 states and 4621 transitions. [2019-10-13 21:24:51,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:51,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-13 21:24:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,840 INFO L225 Difference]: With dead ends: 3110 [2019-10-13 21:24:51,841 INFO L226 Difference]: Without dead ends: 1998 [2019-10-13 21:24:51,844 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-13 21:24:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-10-13 21:24:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1771. [2019-10-13 21:24:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-10-13 21:24:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2632 transitions. [2019-10-13 21:24:51,963 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2632 transitions. Word has length 160 [2019-10-13 21:24:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:51,964 INFO L462 AbstractCegarLoop]: Abstraction has 1771 states and 2632 transitions. [2019-10-13 21:24:51,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2632 transitions. [2019-10-13 21:24:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:24:51,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:51,969 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-13 21:24:51,969 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 753095009, now seen corresponding path program 1 times [2019-10-13 21:24:51,970 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:51,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865268486] [2019-10-13 21:24:51,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:51,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:52,399 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-13 21:24:52,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865268486] [2019-10-13 21:24:52,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:52,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 21:24:52,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866598291] [2019-10-13 21:24:52,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 21:24:52,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 21:24:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:24:52,402 INFO L87 Difference]: Start difference. First operand 1771 states and 2632 transitions. Second operand 13 states. [2019-10-13 21:24:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,625 INFO L93 Difference]: Finished difference Result 14490 states and 22590 transitions. [2019-10-13 21:24:56,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:24:56,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 161 [2019-10-13 21:24:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,697 INFO L225 Difference]: With dead ends: 14490 [2019-10-13 21:24:56,698 INFO L226 Difference]: Without dead ends: 12938 [2019-10-13 21:24:56,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:24:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2019-10-13 21:24:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 7935. [2019-10-13 21:24:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-10-13 21:24:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 12108 transitions. [2019-10-13 21:24:57,346 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 12108 transitions. Word has length 161 [2019-10-13 21:24:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:57,348 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 12108 transitions. [2019-10-13 21:24:57,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 21:24:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 12108 transitions. [2019-10-13 21:24:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:24:57,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:57,356 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-13 21:24:57,356 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1464453224, now seen corresponding path program 1 times [2019-10-13 21:24:57,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:57,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270925361] [2019-10-13 21:24:57,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,727 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-13 21:24:57,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270925361] [2019-10-13 21:24:57,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:57,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668992391] [2019-10-13 21:24:57,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:57,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:57,730 INFO L87 Difference]: Start difference. First operand 7935 states and 12108 transitions. Second operand 9 states. [2019-10-13 21:24:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:58,668 INFO L93 Difference]: Finished difference Result 11115 states and 17157 transitions. [2019-10-13 21:24:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:24:58,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-10-13 21:24:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:58,709 INFO L225 Difference]: With dead ends: 11115 [2019-10-13 21:24:58,710 INFO L226 Difference]: Without dead ends: 3905 [2019-10-13 21:24:58,725 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-13 21:24:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-10-13 21:24:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 2924. [2019-10-13 21:24:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2019-10-13 21:24:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 4420 transitions. [2019-10-13 21:24:58,911 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 4420 transitions. Word has length 161 [2019-10-13 21:24:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:58,911 INFO L462 AbstractCegarLoop]: Abstraction has 2924 states and 4420 transitions. [2019-10-13 21:24:58,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 4420 transitions. [2019-10-13 21:24:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:24:58,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:58,915 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-13 21:24:58,915 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:58,916 INFO L82 PathProgramCache]: Analyzing trace with hash -217483962, now seen corresponding path program 1 times [2019-10-13 21:24:58,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:58,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8194626] [2019-10-13 21:24:58,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:58,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:58,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:59,211 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-13 21:24:59,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8194626] [2019-10-13 21:24:59,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:59,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:59,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293074434] [2019-10-13 21:24:59,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:59,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:59,216 INFO L87 Difference]: Start difference. First operand 2924 states and 4420 transitions. Second operand 9 states. [2019-10-13 21:25:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:00,877 INFO L93 Difference]: Finished difference Result 14166 states and 21917 transitions. [2019-10-13 21:25:00,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:25:00,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-10-13 21:25:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:00,904 INFO L225 Difference]: With dead ends: 14166 [2019-10-13 21:25:00,904 INFO L226 Difference]: Without dead ends: 11461 [2019-10-13 21:25:00,912 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-13 21:25:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-13 21:25:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7578. [2019-10-13 21:25:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7578 states. [2019-10-13 21:25:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11480 transitions. [2019-10-13 21:25:01,489 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11480 transitions. Word has length 161 [2019-10-13 21:25:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:01,490 INFO L462 AbstractCegarLoop]: Abstraction has 7578 states and 11480 transitions. [2019-10-13 21:25:01,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11480 transitions. [2019-10-13 21:25:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:25:01,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:01,498 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-13 21:25:01,498 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1859935101, now seen corresponding path program 1 times [2019-10-13 21:25:01,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:01,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231219788] [2019-10-13 21:25:01,499 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:01,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:01,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:01,746 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-13 21:25:01,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231219788] [2019-10-13 21:25:01,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:01,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:01,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823081155] [2019-10-13 21:25:01,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:01,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:01,752 INFO L87 Difference]: Start difference. First operand 7578 states and 11480 transitions. Second operand 4 states. [2019-10-13 21:25:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:02,212 INFO L93 Difference]: Finished difference Result 14483 states and 22537 transitions. [2019-10-13 21:25:02,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:02,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:25:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:02,239 INFO L225 Difference]: With dead ends: 14483 [2019-10-13 21:25:02,241 INFO L226 Difference]: Without dead ends: 9190 [2019-10-13 21:25:02,259 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-13 21:25:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2019-10-13 21:25:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 9188. [2019-10-13 21:25:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-10-13 21:25:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 14008 transitions. [2019-10-13 21:25:02,850 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 14008 transitions. Word has length 161 [2019-10-13 21:25:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:02,851 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 14008 transitions. [2019-10-13 21:25:02,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 14008 transitions. [2019-10-13 21:25:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:25:02,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:02,856 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-13 21:25:02,856 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1831416783, now seen corresponding path program 1 times [2019-10-13 21:25:02,857 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:02,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517729797] [2019-10-13 21:25:02,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:02,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:02,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:03,048 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-13 21:25:03,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517729797] [2019-10-13 21:25:03,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:03,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:03,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365340812] [2019-10-13 21:25:03,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:03,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:03,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:03,051 INFO L87 Difference]: Start difference. First operand 9188 states and 14008 transitions. Second operand 4 states. [2019-10-13 21:25:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:03,948 INFO L93 Difference]: Finished difference Result 24236 states and 36925 transitions. [2019-10-13 21:25:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:03,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:25:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:03,978 INFO L225 Difference]: With dead ends: 24236 [2019-10-13 21:25:03,978 INFO L226 Difference]: Without dead ends: 15071 [2019-10-13 21:25:03,996 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-13 21:25:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15071 states. [2019-10-13 21:25:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15071 to 15048. [2019-10-13 21:25:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15048 states. [2019-10-13 21:25:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15048 states to 15048 states and 22725 transitions. [2019-10-13 21:25:05,303 INFO L78 Accepts]: Start accepts. Automaton has 15048 states and 22725 transitions. Word has length 161 [2019-10-13 21:25:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:05,303 INFO L462 AbstractCegarLoop]: Abstraction has 15048 states and 22725 transitions. [2019-10-13 21:25:05,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 15048 states and 22725 transitions. [2019-10-13 21:25:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:25:05,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:05,312 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-13 21:25:05,312 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash 668472032, now seen corresponding path program 1 times [2019-10-13 21:25:05,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:05,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073575114] [2019-10-13 21:25:05,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:05,413 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-13 21:25:05,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073575114] [2019-10-13 21:25:05,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:05,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:05,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255434710] [2019-10-13 21:25:05,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:05,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:05,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:05,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:05,415 INFO L87 Difference]: Start difference. First operand 15048 states and 22725 transitions. Second operand 3 states. [2019-10-13 21:25:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:06,827 INFO L93 Difference]: Finished difference Result 43634 states and 66065 transitions. [2019-10-13 21:25:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:06,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-13 21:25:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:06,888 INFO L225 Difference]: With dead ends: 43634 [2019-10-13 21:25:06,889 INFO L226 Difference]: Without dead ends: 28974 [2019-10-13 21:25:06,918 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-13 21:25:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28974 states. [2019-10-13 21:25:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28974 to 28953. [2019-10-13 21:25:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28953 states. [2019-10-13 21:25:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28953 states to 28953 states and 43506 transitions. [2019-10-13 21:25:09,501 INFO L78 Accepts]: Start accepts. Automaton has 28953 states and 43506 transitions. Word has length 163 [2019-10-13 21:25:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,501 INFO L462 AbstractCegarLoop]: Abstraction has 28953 states and 43506 transitions. [2019-10-13 21:25:09,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28953 states and 43506 transitions. [2019-10-13 21:25:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-13 21:25:09,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,513 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-13 21:25:09,513 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1439315485, now seen corresponding path program 1 times [2019-10-13 21:25:09,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309460856] [2019-10-13 21:25:09,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,647 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-13 21:25:09,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309460856] [2019-10-13 21:25:09,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:09,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760587781] [2019-10-13 21:25:09,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:09,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:09,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,650 INFO L87 Difference]: Start difference. First operand 28953 states and 43506 transitions. Second operand 4 states. [2019-10-13 21:25:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:10,872 INFO L93 Difference]: Finished difference Result 46825 states and 70222 transitions. [2019-10-13 21:25:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:10,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-13 21:25:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:10,896 INFO L225 Difference]: With dead ends: 46825 [2019-10-13 21:25:10,896 INFO L226 Difference]: Without dead ends: 23474 [2019-10-13 21:25:10,928 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-13 21:25:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23474 states. [2019-10-13 21:25:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23474 to 23474. [2019-10-13 21:25:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23474 states. [2019-10-13 21:25:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23474 states to 23474 states and 35144 transitions. [2019-10-13 21:25:13,052 INFO L78 Accepts]: Start accepts. Automaton has 23474 states and 35144 transitions. Word has length 163 [2019-10-13 21:25:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:13,052 INFO L462 AbstractCegarLoop]: Abstraction has 23474 states and 35144 transitions. [2019-10-13 21:25:13,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 23474 states and 35144 transitions. [2019-10-13 21:25:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:25:13,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:13,061 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-13 21:25:13,062 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1713355484, now seen corresponding path program 1 times [2019-10-13 21:25:13,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:13,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655593589] [2019-10-13 21:25:13,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,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-10-13 21:25:13,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655593589] [2019-10-13 21:25:13,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:13,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898396593] [2019-10-13 21:25:13,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:13,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:13,154 INFO L87 Difference]: Start difference. First operand 23474 states and 35144 transitions. Second operand 3 states. [2019-10-13 21:25:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,943 INFO L93 Difference]: Finished difference Result 62336 states and 94477 transitions. [2019-10-13 21:25:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:15,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-13 21:25:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,986 INFO L225 Difference]: With dead ends: 62336 [2019-10-13 21:25:15,986 INFO L226 Difference]: Without dead ends: 39198 [2019-10-13 21:25:16,006 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-13 21:25:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39198 states. [2019-10-13 21:25:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39198 to 35602. [2019-10-13 21:25:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35602 states. [2019-10-13 21:25:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35602 states to 35602 states and 54441 transitions. [2019-10-13 21:25:18,099 INFO L78 Accepts]: Start accepts. Automaton has 35602 states and 54441 transitions. Word has length 167 [2019-10-13 21:25:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:18,099 INFO L462 AbstractCegarLoop]: Abstraction has 35602 states and 54441 transitions. [2019-10-13 21:25:18,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35602 states and 54441 transitions. [2019-10-13 21:25:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-13 21:25:18,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:18,106 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, 1] [2019-10-13 21:25:18,107 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2046979909, now seen corresponding path program 1 times [2019-10-13 21:25:18,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:18,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053951191] [2019-10-13 21:25:18,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,279 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-13 21:25:18,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053951191] [2019-10-13 21:25:18,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:18,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937673229] [2019-10-13 21:25:18,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:18,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:18,282 INFO L87 Difference]: Start difference. First operand 35602 states and 54441 transitions. Second operand 4 states.