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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:23:32,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:23:32,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:23:32,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:23:32,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:23:32,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:23:32,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:23:32,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:23:32,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:23:32,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:23:32,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:23:32,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:23:32,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:23:32,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:23:32,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:23:32,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:23:32,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:23:32,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:23:32,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:23:32,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:23:32,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:23:32,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:23:32,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:23:32,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:23:32,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:23:32,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:23:32,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:23:32,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:23:32,774 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:23:32,775 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:23:32,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:23:32,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:23:32,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:23:32,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:23:32,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:23:32,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:23:32,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:23:32,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:23:32,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:23:32,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:23:32,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:23:32,783 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:23:32,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:23:32,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:23:32,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:23:32,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:23:32,798 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:23:32,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:23:32,799 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:23:32,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:23:32,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:23:32,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:23:32,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:23:32,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:23:32,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:23:32,800 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:23:32,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:23:32,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:23:32,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:23:32,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:23:32,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:23:32,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:23:32,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:23:32,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:23:32,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:23:32,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:23:32,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:23:32,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:23:32,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:23:32,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:23:32,803 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:23:33,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:23:33,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:23:33,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:23:33,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:23:33,169 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:23:33,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:33,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8667f884/bb35090839834c62b42ec616f059740d/FLAG3caf9ec0d [2019-10-13 21:23:33,698 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:23:33,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:33,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8667f884/bb35090839834c62b42ec616f059740d/FLAG3caf9ec0d [2019-10-13 21:23:34,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8667f884/bb35090839834c62b42ec616f059740d [2019-10-13 21:23:34,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:23:34,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:23:34,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:34,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:23:34,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:23:34,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8a50b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34, skipping insertion in model container [2019-10-13 21:23:34,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:23:34,123 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:23:34,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:34,651 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:23:34,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:23:34,818 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:23:34,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34 WrapperNode [2019-10-13 21:23:34,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:23:34,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:23:34,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:23:34,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:23:34,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (1/1) ... [2019-10-13 21:23:34,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:23:34,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:23:34,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:23:34,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:23:34,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (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:23:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:23:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:23:34,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:23:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:23:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:23:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:23:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:23:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:23:34,973 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:23:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:23:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:23:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:23:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:23:34,974 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:23:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:23:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:23:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:23:34,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:23:36,303 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:23:36,303 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:23:36,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:36 BoogieIcfgContainer [2019-10-13 21:23:36,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:23:36,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:23:36,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:23:36,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:23:36,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:34" (1/3) ... [2019-10-13 21:23:36,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1847b1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:36, skipping insertion in model container [2019-10-13 21:23:36,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:34" (2/3) ... [2019-10-13 21:23:36,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1847b1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:36, skipping insertion in model container [2019-10-13 21:23:36,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:36" (3/3) ... [2019-10-13 21:23:36,317 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 21:23:36,327 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:23:36,335 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:23:36,347 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:23:36,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:23:36,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:23:36,376 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:23:36,376 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:23:36,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:23:36,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:23:36,377 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:23:36,377 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:23:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states. [2019-10-13 21:23:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:23:36,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:36,424 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] [2019-10-13 21:23:36,426 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash 343036633, now seen corresponding path program 1 times [2019-10-13 21:23:36,442 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:36,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000666603] [2019-10-13 21:23:36,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:36,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:36,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:37,182 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:23:37,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000666603] [2019-10-13 21:23:37,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:37,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:37,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9417262] [2019-10-13 21:23:37,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:37,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:37,212 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 4 states. [2019-10-13 21:23:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:37,420 INFO L93 Difference]: Finished difference Result 636 states and 1118 transitions. [2019-10-13 21:23:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:23:37,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-13 21:23:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:37,438 INFO L225 Difference]: With dead ends: 636 [2019-10-13 21:23:37,439 INFO L226 Difference]: Without dead ends: 418 [2019-10-13 21:23:37,444 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:23:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-13 21:23:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2019-10-13 21:23:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-13 21:23:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 609 transitions. [2019-10-13 21:23:37,554 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 609 transitions. Word has length 98 [2019-10-13 21:23:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:37,555 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 609 transitions. [2019-10-13 21:23:37,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 609 transitions. [2019-10-13 21:23:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:23:37,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:37,569 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] [2019-10-13 21:23:37,569 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:37,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:37,570 INFO L82 PathProgramCache]: Analyzing trace with hash -936762471, now seen corresponding path program 1 times [2019-10-13 21:23:37,570 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:37,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942692727] [2019-10-13 21:23:37,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:37,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:37,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:37,733 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:23:37,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942692727] [2019-10-13 21:23:37,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:37,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:37,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381313018] [2019-10-13 21:23:37,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:37,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:37,738 INFO L87 Difference]: Start difference. First operand 416 states and 609 transitions. Second operand 3 states. [2019-10-13 21:23:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:37,814 INFO L93 Difference]: Finished difference Result 1202 states and 1757 transitions. [2019-10-13 21:23:37,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:37,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-13 21:23:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:37,821 INFO L225 Difference]: With dead ends: 1202 [2019-10-13 21:23:37,821 INFO L226 Difference]: Without dead ends: 818 [2019-10-13 21:23:37,825 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:23:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-13 21:23:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 418. [2019-10-13 21:23:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-13 21:23:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-10-13 21:23:37,895 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 99 [2019-10-13 21:23:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:37,896 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-10-13 21:23:37,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-10-13 21:23:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:23:37,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:37,899 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] [2019-10-13 21:23:37,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:37,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:37,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1773874167, now seen corresponding path program 1 times [2019-10-13 21:23:37,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:37,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244041495] [2019-10-13 21:23:37,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:37,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:37,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:38,050 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:23:38,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244041495] [2019-10-13 21:23:38,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:38,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:38,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135383856] [2019-10-13 21:23:38,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:38,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:38,053 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 3 states. [2019-10-13 21:23:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:38,129 INFO L93 Difference]: Finished difference Result 1038 states and 1538 transitions. [2019-10-13 21:23:38,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:38,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-13 21:23:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:38,135 INFO L225 Difference]: With dead ends: 1038 [2019-10-13 21:23:38,135 INFO L226 Difference]: Without dead ends: 802 [2019-10-13 21:23:38,136 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:23:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-13 21:23:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2019-10-13 21:23:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-10-13 21:23:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1163 transitions. [2019-10-13 21:23:38,182 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1163 transitions. Word has length 100 [2019-10-13 21:23:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:38,183 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1163 transitions. [2019-10-13 21:23:38,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1163 transitions. [2019-10-13 21:23:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:23:38,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,187 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] [2019-10-13 21:23:38,187 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1816624602, now seen corresponding path program 1 times [2019-10-13 21:23:38,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921576984] [2019-10-13 21:23:38,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:38,332 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:23:38,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921576984] [2019-10-13 21:23:38,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:38,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:38,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993309356] [2019-10-13 21:23:38,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:38,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:38,335 INFO L87 Difference]: Start difference. First operand 800 states and 1163 transitions. Second operand 4 states. [2019-10-13 21:23:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:38,404 INFO L93 Difference]: Finished difference Result 1239 states and 1819 transitions. [2019-10-13 21:23:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:38,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-13 21:23:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:38,410 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 21:23:38,410 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 21:23:38,412 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:23:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 21:23:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 21:23:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 21:23:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 883 transitions. [2019-10-13 21:23:38,445 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 883 transitions. Word has length 100 [2019-10-13 21:23:38,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:38,446 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 883 transitions. [2019-10-13 21:23:38,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 883 transitions. [2019-10-13 21:23:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:23:38,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,449 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] [2019-10-13 21:23:38,449 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1713248280, now seen corresponding path program 1 times [2019-10-13 21:23:38,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520698994] [2019-10-13 21:23:38,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:38,649 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:23:38,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520698994] [2019-10-13 21:23:38,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:38,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:38,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167432799] [2019-10-13 21:23:38,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:38,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:38,652 INFO L87 Difference]: Start difference. First operand 611 states and 883 transitions. Second operand 4 states. [2019-10-13 21:23:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:38,774 INFO L93 Difference]: Finished difference Result 1485 states and 2148 transitions. [2019-10-13 21:23:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:38,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 21:23:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:38,779 INFO L225 Difference]: With dead ends: 1485 [2019-10-13 21:23:38,780 INFO L226 Difference]: Without dead ends: 897 [2019-10-13 21:23:38,782 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:23:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-13 21:23:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2019-10-13 21:23:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-13 21:23:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1282 transitions. [2019-10-13 21:23:38,842 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1282 transitions. Word has length 102 [2019-10-13 21:23:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:38,843 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1282 transitions. [2019-10-13 21:23:38,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1282 transitions. [2019-10-13 21:23:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:23:38,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:38,846 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] [2019-10-13 21:23:38,846 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1610605002, now seen corresponding path program 1 times [2019-10-13 21:23:38,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:38,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446190984] [2019-10-13 21:23:38,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:38,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:38,939 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:23:38,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446190984] [2019-10-13 21:23:38,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:38,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:38,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376767200] [2019-10-13 21:23:38,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:38,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:38,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:38,943 INFO L87 Difference]: Start difference. First operand 895 states and 1282 transitions. Second operand 3 states. [2019-10-13 21:23:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:39,087 INFO L93 Difference]: Finished difference Result 2174 states and 3182 transitions. [2019-10-13 21:23:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:39,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-13 21:23:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:39,101 INFO L225 Difference]: With dead ends: 2174 [2019-10-13 21:23:39,102 INFO L226 Difference]: Without dead ends: 1607 [2019-10-13 21:23:39,104 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:23:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-10-13 21:23:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2019-10-13 21:23:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-10-13 21:23:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2301 transitions. [2019-10-13 21:23:39,215 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2301 transitions. Word has length 104 [2019-10-13 21:23:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:39,217 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 2301 transitions. [2019-10-13 21:23:39,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2301 transitions. [2019-10-13 21:23:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:23:39,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:39,223 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] [2019-10-13 21:23:39,223 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash -817857369, now seen corresponding path program 1 times [2019-10-13 21:23:39,224 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:39,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337352260] [2019-10-13 21:23:39,224 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,225 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,403 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:23:39,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337352260] [2019-10-13 21:23:39,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:39,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156980550] [2019-10-13 21:23:39,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:39,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:39,405 INFO L87 Difference]: Start difference. First operand 1605 states and 2301 transitions. Second operand 4 states. [2019-10-13 21:23:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:39,501 INFO L93 Difference]: Finished difference Result 2391 states and 3456 transitions. [2019-10-13 21:23:39,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:39,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 21:23:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:39,508 INFO L225 Difference]: With dead ends: 2391 [2019-10-13 21:23:39,508 INFO L226 Difference]: Without dead ends: 1319 [2019-10-13 21:23:39,511 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:23:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-10-13 21:23:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2019-10-13 21:23:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-10-13 21:23:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1881 transitions. [2019-10-13 21:23:39,591 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1881 transitions. Word has length 104 [2019-10-13 21:23:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:39,591 INFO L462 AbstractCegarLoop]: Abstraction has 1319 states and 1881 transitions. [2019-10-13 21:23:39,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1881 transitions. [2019-10-13 21:23:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:23:39,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:39,594 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] [2019-10-13 21:23:39,595 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash 669169858, now seen corresponding path program 1 times [2019-10-13 21:23:39,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:39,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861813411] [2019-10-13 21:23:39,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:39,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:23:39,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861813411] [2019-10-13 21:23:39,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:39,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:39,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375534198] [2019-10-13 21:23:39,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:39,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:39,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:39,676 INFO L87 Difference]: Start difference. First operand 1319 states and 1881 transitions. Second operand 3 states. [2019-10-13 21:23:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:40,073 INFO L93 Difference]: Finished difference Result 3197 states and 4694 transitions. [2019-10-13 21:23:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:40,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-13 21:23:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:40,088 INFO L225 Difference]: With dead ends: 3197 [2019-10-13 21:23:40,088 INFO L226 Difference]: Without dead ends: 2376 [2019-10-13 21:23:40,093 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:23:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-10-13 21:23:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2374. [2019-10-13 21:23:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-10-13 21:23:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3419 transitions. [2019-10-13 21:23:40,314 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3419 transitions. Word has length 106 [2019-10-13 21:23:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:40,316 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 3419 transitions. [2019-10-13 21:23:40,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3419 transitions. [2019-10-13 21:23:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:23:40,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:40,323 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] [2019-10-13 21:23:40,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -53512537, now seen corresponding path program 1 times [2019-10-13 21:23:40,325 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:40,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512165110] [2019-10-13 21:23:40,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,326 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:40,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:40,619 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:23:40,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512165110] [2019-10-13 21:23:40,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:40,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:40,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140639389] [2019-10-13 21:23:40,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:40,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:40,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:40,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:40,627 INFO L87 Difference]: Start difference. First operand 2374 states and 3419 transitions. Second operand 4 states. [2019-10-13 21:23:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,051 INFO L93 Difference]: Finished difference Result 6864 states and 9875 transitions. [2019-10-13 21:23:41,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:41,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:23:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:41,075 INFO L225 Difference]: With dead ends: 6864 [2019-10-13 21:23:41,075 INFO L226 Difference]: Without dead ends: 4533 [2019-10-13 21:23:41,082 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:23:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-10-13 21:23:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4531. [2019-10-13 21:23:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-10-13 21:23:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6454 transitions. [2019-10-13 21:23:41,406 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6454 transitions. Word has length 106 [2019-10-13 21:23:41,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:41,407 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6454 transitions. [2019-10-13 21:23:41,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6454 transitions. [2019-10-13 21:23:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:23:41,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:41,414 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] [2019-10-13 21:23:41,414 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2125527721, now seen corresponding path program 1 times [2019-10-13 21:23:41,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:41,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121463885] [2019-10-13 21:23:41,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:41,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:41,471 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:23:41,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121463885] [2019-10-13 21:23:41,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:41,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:41,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472273077] [2019-10-13 21:23:41,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:41,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:41,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:41,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:41,475 INFO L87 Difference]: Start difference. First operand 4531 states and 6454 transitions. Second operand 3 states. [2019-10-13 21:23:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:41,958 INFO L93 Difference]: Finished difference Result 13393 states and 19105 transitions. [2019-10-13 21:23:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:41,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 21:23:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:42,017 INFO L225 Difference]: With dead ends: 13393 [2019-10-13 21:23:42,019 INFO L226 Difference]: Without dead ends: 8971 [2019-10-13 21:23:42,044 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:23:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2019-10-13 21:23:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 4537. [2019-10-13 21:23:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-10-13 21:23:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6460 transitions. [2019-10-13 21:23:42,651 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6460 transitions. Word has length 107 [2019-10-13 21:23:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:42,651 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 6460 transitions. [2019-10-13 21:23:42,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6460 transitions. [2019-10-13 21:23:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:23:42,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:42,662 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] [2019-10-13 21:23:42,662 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash -871367960, now seen corresponding path program 1 times [2019-10-13 21:23:42,663 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:42,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157569163] [2019-10-13 21:23:42,663 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,664 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:42,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:42,803 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:23:42,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157569163] [2019-10-13 21:23:42,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:42,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:42,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406896343] [2019-10-13 21:23:42,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:42,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:42,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:42,805 INFO L87 Difference]: Start difference. First operand 4537 states and 6460 transitions. Second operand 4 states. [2019-10-13 21:23:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:43,054 INFO L93 Difference]: Finished difference Result 9032 states and 12864 transitions. [2019-10-13 21:23:43,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:43,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-13 21:23:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:43,097 INFO L225 Difference]: With dead ends: 9032 [2019-10-13 21:23:43,098 INFO L226 Difference]: Without dead ends: 4531 [2019-10-13 21:23:43,111 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:23:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2019-10-13 21:23:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2019-10-13 21:23:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-10-13 21:23:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6448 transitions. [2019-10-13 21:23:43,467 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6448 transitions. Word has length 108 [2019-10-13 21:23:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:43,468 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6448 transitions. [2019-10-13 21:23:43,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6448 transitions. [2019-10-13 21:23:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 21:23:43,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:43,475 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] [2019-10-13 21:23:43,475 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:43,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1746692037, now seen corresponding path program 1 times [2019-10-13 21:23:43,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:43,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9192591] [2019-10-13 21:23:43,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:43,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:43,569 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:23:43,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9192591] [2019-10-13 21:23:43,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:43,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:43,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586935487] [2019-10-13 21:23:43,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:43,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:43,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:43,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:43,573 INFO L87 Difference]: Start difference. First operand 4531 states and 6448 transitions. Second operand 3 states. [2019-10-13 21:23:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:44,073 INFO L93 Difference]: Finished difference Result 10307 states and 14773 transitions. [2019-10-13 21:23:44,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:44,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-10-13 21:23:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:44,091 INFO L225 Difference]: With dead ends: 10307 [2019-10-13 21:23:44,092 INFO L226 Difference]: Without dead ends: 6717 [2019-10-13 21:23:44,104 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:23:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2019-10-13 21:23:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6715. [2019-10-13 21:23:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6715 states. [2019-10-13 21:23:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 9383 transitions. [2019-10-13 21:23:44,737 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 9383 transitions. Word has length 108 [2019-10-13 21:23:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:44,738 INFO L462 AbstractCegarLoop]: Abstraction has 6715 states and 9383 transitions. [2019-10-13 21:23:44,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 9383 transitions. [2019-10-13 21:23:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:23:44,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:44,749 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] [2019-10-13 21:23:44,749 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash -848505304, now seen corresponding path program 1 times [2019-10-13 21:23:44,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:44,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917260241] [2019-10-13 21:23:44,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:44,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:44,931 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:23:44,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917260241] [2019-10-13 21:23:44,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:44,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:44,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098662183] [2019-10-13 21:23:44,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:44,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:44,934 INFO L87 Difference]: Start difference. First operand 6715 states and 9383 transitions. Second operand 4 states. [2019-10-13 21:23:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:45,349 INFO L93 Difference]: Finished difference Result 12456 states and 17427 transitions. [2019-10-13 21:23:45,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:45,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 21:23:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:45,364 INFO L225 Difference]: With dead ends: 12456 [2019-10-13 21:23:45,364 INFO L226 Difference]: Without dead ends: 6092 [2019-10-13 21:23:45,379 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:23:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2019-10-13 21:23:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 6023. [2019-10-13 21:23:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6023 states. [2019-10-13 21:23:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 8366 transitions. [2019-10-13 21:23:45,896 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 8366 transitions. Word has length 110 [2019-10-13 21:23:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:45,897 INFO L462 AbstractCegarLoop]: Abstraction has 6023 states and 8366 transitions. [2019-10-13 21:23:45,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 8366 transitions. [2019-10-13 21:23:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:23:45,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:45,908 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] [2019-10-13 21:23:45,908 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1621946400, now seen corresponding path program 1 times [2019-10-13 21:23:45,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:45,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502602437] [2019-10-13 21:23:45,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:45,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:45,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:45,976 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:23:45,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502602437] [2019-10-13 21:23:45,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:45,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:45,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387042472] [2019-10-13 21:23:45,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:45,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:45,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:45,979 INFO L87 Difference]: Start difference. First operand 6023 states and 8366 transitions. Second operand 3 states. [2019-10-13 21:23:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:46,784 INFO L93 Difference]: Finished difference Result 14841 states and 21156 transitions. [2019-10-13 21:23:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:46,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-13 21:23:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:46,806 INFO L225 Difference]: With dead ends: 14841 [2019-10-13 21:23:46,806 INFO L226 Difference]: Without dead ends: 10994 [2019-10-13 21:23:46,816 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:23:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10994 states. [2019-10-13 21:23:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10994 to 10992. [2019-10-13 21:23:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10992 states. [2019-10-13 21:23:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10992 states to 10992 states and 15347 transitions. [2019-10-13 21:23:47,455 INFO L78 Accepts]: Start accepts. Automaton has 10992 states and 15347 transitions. Word has length 112 [2019-10-13 21:23:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:47,455 INFO L462 AbstractCegarLoop]: Abstraction has 10992 states and 15347 transitions. [2019-10-13 21:23:47,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 10992 states and 15347 transitions. [2019-10-13 21:23:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:23:47,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:47,470 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] [2019-10-13 21:23:47,471 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:47,471 INFO L82 PathProgramCache]: Analyzing trace with hash 900773541, now seen corresponding path program 1 times [2019-10-13 21:23:47,471 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:47,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091122174] [2019-10-13 21:23:47,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:47,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:47,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:48,125 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:23:48,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091122174] [2019-10-13 21:23:48,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:48,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:23:48,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688413262] [2019-10-13 21:23:48,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:23:48,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:23:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:23:48,128 INFO L87 Difference]: Start difference. First operand 10992 states and 15347 transitions. Second operand 4 states. [2019-10-13 21:23:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:48,883 INFO L93 Difference]: Finished difference Result 22202 states and 30971 transitions. [2019-10-13 21:23:48,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:23:48,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:23:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:48,909 INFO L225 Difference]: With dead ends: 22202 [2019-10-13 21:23:48,910 INFO L226 Difference]: Without dead ends: 11365 [2019-10-13 21:23:48,934 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:23:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2019-10-13 21:23:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 11179. [2019-10-13 21:23:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11179 states. [2019-10-13 21:23:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11179 states to 11179 states and 15555 transitions. [2019-10-13 21:23:49,551 INFO L78 Accepts]: Start accepts. Automaton has 11179 states and 15555 transitions. Word has length 112 [2019-10-13 21:23:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:49,551 INFO L462 AbstractCegarLoop]: Abstraction has 11179 states and 15555 transitions. [2019-10-13 21:23:49,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:23:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 11179 states and 15555 transitions. [2019-10-13 21:23:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:23:49,565 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:49,565 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] [2019-10-13 21:23:49,565 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:49,566 INFO L82 PathProgramCache]: Analyzing trace with hash 288500069, now seen corresponding path program 1 times [2019-10-13 21:23:49,566 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:49,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649490732] [2019-10-13 21:23:49,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:49,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:49,618 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:23:49,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649490732] [2019-10-13 21:23:49,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:49,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:49,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289141627] [2019-10-13 21:23:49,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:49,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:49,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:49,621 INFO L87 Difference]: Start difference. First operand 11179 states and 15555 transitions. Second operand 3 states. [2019-10-13 21:23:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:50,888 INFO L93 Difference]: Finished difference Result 29974 states and 41914 transitions. [2019-10-13 21:23:50,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:23:50,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-13 21:23:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:50,936 INFO L225 Difference]: With dead ends: 29974 [2019-10-13 21:23:50,937 INFO L226 Difference]: Without dead ends: 22153 [2019-10-13 21:23:50,954 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:23:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22153 states. [2019-10-13 21:23:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22153 to 11189. [2019-10-13 21:23:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11189 states. [2019-10-13 21:23:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 15565 transitions. [2019-10-13 21:23:51,634 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 15565 transitions. Word has length 113 [2019-10-13 21:23:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:51,634 INFO L462 AbstractCegarLoop]: Abstraction has 11189 states and 15565 transitions. [2019-10-13 21:23:51,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:23:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 15565 transitions. [2019-10-13 21:23:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:23:51,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:51,722 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] [2019-10-13 21:23:51,722 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash -431095923, now seen corresponding path program 1 times [2019-10-13 21:23:51,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:51,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462140468] [2019-10-13 21:23:51,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:51,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:51,999 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:23:51,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462140468] [2019-10-13 21:23:51,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:52,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:23:52,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957483408] [2019-10-13 21:23:52,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:23:52,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:23:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:23:52,001 INFO L87 Difference]: Start difference. First operand 11189 states and 15565 transitions. Second operand 12 states. [2019-10-13 21:23:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:23:55,016 INFO L93 Difference]: Finished difference Result 37443 states and 55319 transitions. [2019-10-13 21:23:55,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:23:55,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 114 [2019-10-13 21:23:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:23:55,108 INFO L225 Difference]: With dead ends: 37443 [2019-10-13 21:23:55,109 INFO L226 Difference]: Without dead ends: 30501 [2019-10-13 21:23:55,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:23:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30501 states. [2019-10-13 21:23:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30501 to 25435. [2019-10-13 21:23:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25435 states. [2019-10-13 21:23:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25435 states to 25435 states and 36699 transitions. [2019-10-13 21:23:56,758 INFO L78 Accepts]: Start accepts. Automaton has 25435 states and 36699 transitions. Word has length 114 [2019-10-13 21:23:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:23:56,758 INFO L462 AbstractCegarLoop]: Abstraction has 25435 states and 36699 transitions. [2019-10-13 21:23:56,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:23:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 25435 states and 36699 transitions. [2019-10-13 21:23:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:23:56,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:23:56,778 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] [2019-10-13 21:23:56,779 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:23:56,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:23:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1784609226, now seen corresponding path program 1 times [2019-10-13 21:23:56,779 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:23:56,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999406286] [2019-10-13 21:23:56,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:23:56,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:23:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:23:56,866 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:23:56,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999406286] [2019-10-13 21:23:56,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:23:56,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:23:56,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953817210] [2019-10-13 21:23:56,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:23:56,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:23:56,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:23:56,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:23:56,869 INFO L87 Difference]: Start difference. First operand 25435 states and 36699 transitions. Second operand 3 states. [2019-10-13 21:24:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:00,058 INFO L93 Difference]: Finished difference Result 58469 states and 88539 transitions. [2019-10-13 21:24:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:00,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-13 21:24:00,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:00,170 INFO L225 Difference]: With dead ends: 58469 [2019-10-13 21:24:00,170 INFO L226 Difference]: Without dead ends: 41921 [2019-10-13 21:24:00,204 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:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41921 states. [2019-10-13 21:24:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41921 to 41919. [2019-10-13 21:24:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41919 states. [2019-10-13 21:24:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41919 states to 41919 states and 61685 transitions. [2019-10-13 21:24:03,542 INFO L78 Accepts]: Start accepts. Automaton has 41919 states and 61685 transitions. Word has length 114 [2019-10-13 21:24:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:03,542 INFO L462 AbstractCegarLoop]: Abstraction has 41919 states and 61685 transitions. [2019-10-13 21:24:03,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 41919 states and 61685 transitions. [2019-10-13 21:24:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:03,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:03,555 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] [2019-10-13 21:24:03,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1465323800, now seen corresponding path program 1 times [2019-10-13 21:24:03,556 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:03,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896118211] [2019-10-13 21:24:03,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:03,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:03,745 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:03,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896118211] [2019-10-13 21:24:03,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:03,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:03,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554566825] [2019-10-13 21:24:03,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:03,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:03,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:03,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:03,750 INFO L87 Difference]: Start difference. First operand 41919 states and 61685 transitions. Second operand 8 states.