/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:07,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:07,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:07,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:07,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:07,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:07,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:07,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:07,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:07,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:07,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:07,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:07,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:07,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:07,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:07,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:07,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:07,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:07,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:07,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:07,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:07,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:07,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:07,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:07,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:07,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:07,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:07,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:07,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:07,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:07,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:07,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:07,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:07,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:07,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:07,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:07,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:07,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:07,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:07,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:07,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:07,887 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-11-07 01:06:07,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:07,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:07,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:07,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:07,912 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:07,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:07,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:07,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:07,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:07,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:07,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:07,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:07,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:07,915 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:07,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:07,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:07,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:07,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:07,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:07,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:07,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:07,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:07,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:07,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:07,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:07,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:07,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:07,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:07,918 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-11-07 01:06:08,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:08,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:08,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:08,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:08,221 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:08,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 01:06:08,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cfd8a2c/2bb546517c234ae49df3bdc61443add4/FLAG73b1ebeab [2019-11-07 01:06:08,897 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:08,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 01:06:08,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cfd8a2c/2bb546517c234ae49df3bdc61443add4/FLAG73b1ebeab [2019-11-07 01:06:09,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65cfd8a2c/2bb546517c234ae49df3bdc61443add4 [2019-11-07 01:06:09,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:09,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:09,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:09,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:09,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:09,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6178a6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09, skipping insertion in model container [2019-11-07 01:06:09,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,189 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:09,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:09,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:09,663 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:09,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:09,774 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:09,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09 WrapperNode [2019-11-07 01:06:09,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:09,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:09,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:09,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:09,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (1/1) ... [2019-11-07 01:06:09,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:09,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:09,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:09,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:09,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (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-11-07 01:06:09,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:09,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:09,889 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:09,892 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:09,893 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:09,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:09,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:09,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:10,773 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:10,773 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:10,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:10 BoogieIcfgContainer [2019-11-07 01:06:10,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:10,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:10,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:10,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:10,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:09" (1/3) ... [2019-11-07 01:06:10,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd39163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:10, skipping insertion in model container [2019-11-07 01:06:10,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:09" (2/3) ... [2019-11-07 01:06:10,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd39163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:10, skipping insertion in model container [2019-11-07 01:06:10,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:10" (3/3) ... [2019-11-07 01:06:10,783 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-07 01:06:10,792 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:10,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:06:10,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:06:10,855 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:10,855 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:10,856 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:10,856 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:10,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:10,856 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:10,856 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:10,856 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-07 01:06:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-07 01:06:10,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:10,888 INFO L410 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] [2019-11-07 01:06:10,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1085569870, now seen corresponding path program 1 times [2019-11-07 01:06:10,904 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:10,904 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497671941] [2019-11-07 01:06:10,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:11,330 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497671941] [2019-11-07 01:06:11,331 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:11,331 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:11,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833178705] [2019-11-07 01:06:11,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:11,341 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:11,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:11,359 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-11-07 01:06:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:11,506 INFO L93 Difference]: Finished difference Result 342 states and 566 transitions. [2019-11-07 01:06:11,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:11,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-07 01:06:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:11,524 INFO L225 Difference]: With dead ends: 342 [2019-11-07 01:06:11,524 INFO L226 Difference]: Without dead ends: 235 [2019-11-07 01:06:11,531 INFO L630 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-11-07 01:06:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-07 01:06:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-11-07 01:06:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-07 01:06:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 363 transitions. [2019-11-07 01:06:11,601 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 363 transitions. Word has length 60 [2019-11-07 01:06:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:11,602 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 363 transitions. [2019-11-07 01:06:11,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 363 transitions. [2019-11-07 01:06:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 01:06:11,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:11,606 INFO L410 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] [2019-11-07 01:06:11,606 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1093309265, now seen corresponding path program 1 times [2019-11-07 01:06:11,607 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:11,607 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74296833] [2019-11-07 01:06:11,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:11,776 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74296833] [2019-11-07 01:06:11,777 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:11,777 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:11,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171553343] [2019-11-07 01:06:11,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:11,779 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:11,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:11,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:11,780 INFO L87 Difference]: Start difference. First operand 232 states and 363 transitions. Second operand 3 states. [2019-11-07 01:06:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:11,850 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-11-07 01:06:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:11,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-07 01:06:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:11,855 INFO L225 Difference]: With dead ends: 570 [2019-11-07 01:06:11,855 INFO L226 Difference]: Without dead ends: 393 [2019-11-07 01:06:11,857 INFO L630 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-11-07 01:06:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-07 01:06:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2019-11-07 01:06:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-07 01:06:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 618 transitions. [2019-11-07 01:06:11,898 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 618 transitions. Word has length 62 [2019-11-07 01:06:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:11,899 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 618 transitions. [2019-11-07 01:06:11,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 618 transitions. [2019-11-07 01:06:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-07 01:06:11,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:11,903 INFO L410 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] [2019-11-07 01:06:11,903 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:11,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash 647852560, now seen corresponding path program 1 times [2019-11-07 01:06:11,904 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:11,904 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248623527] [2019-11-07 01:06:11,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:12,047 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248623527] [2019-11-07 01:06:12,047 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:12,047 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:12,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405385171] [2019-11-07 01:06:12,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:12,048 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:12,049 INFO L87 Difference]: Start difference. First operand 389 states and 618 transitions. Second operand 3 states. [2019-11-07 01:06:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:12,123 INFO L93 Difference]: Finished difference Result 1025 states and 1652 transitions. [2019-11-07 01:06:12,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:12,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-07 01:06:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:12,132 INFO L225 Difference]: With dead ends: 1025 [2019-11-07 01:06:12,139 INFO L226 Difference]: Without dead ends: 691 [2019-11-07 01:06:12,146 INFO L630 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-11-07 01:06:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-07 01:06:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 685. [2019-11-07 01:06:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-07 01:06:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1094 transitions. [2019-11-07 01:06:12,210 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1094 transitions. Word has length 64 [2019-11-07 01:06:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:12,211 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1094 transitions. [2019-11-07 01:06:12,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1094 transitions. [2019-11-07 01:06:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 01:06:12,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:12,215 INFO L410 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] [2019-11-07 01:06:12,215 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash -971934415, now seen corresponding path program 1 times [2019-11-07 01:06:12,216 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:12,216 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648836087] [2019-11-07 01:06:12,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:12,360 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648836087] [2019-11-07 01:06:12,360 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:12,360 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:12,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050177399] [2019-11-07 01:06:12,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:12,385 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:12,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:12,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:12,386 INFO L87 Difference]: Start difference. First operand 685 states and 1094 transitions. Second operand 5 states. [2019-11-07 01:06:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:12,572 INFO L93 Difference]: Finished difference Result 2313 states and 3756 transitions. [2019-11-07 01:06:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:12,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-07 01:06:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:12,586 INFO L225 Difference]: With dead ends: 2313 [2019-11-07 01:06:12,586 INFO L226 Difference]: Without dead ends: 1683 [2019-11-07 01:06:12,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:12,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-07 01:06:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1500. [2019-11-07 01:06:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-11-07 01:06:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2423 transitions. [2019-11-07 01:06:12,679 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2423 transitions. Word has length 66 [2019-11-07 01:06:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:12,680 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 2423 transitions. [2019-11-07 01:06:12,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2423 transitions. [2019-11-07 01:06:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-07 01:06:12,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:12,684 INFO L410 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] [2019-11-07 01:06:12,684 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -126806256, now seen corresponding path program 1 times [2019-11-07 01:06:12,684 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:12,685 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450501038] [2019-11-07 01:06:12,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:12,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450501038] [2019-11-07 01:06:12,803 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:12,803 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:06:12,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769746055] [2019-11-07 01:06:12,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:06:12,804 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:06:12,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:06:12,805 INFO L87 Difference]: Start difference. First operand 1500 states and 2423 transitions. Second operand 6 states. [2019-11-07 01:06:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:13,203 INFO L93 Difference]: Finished difference Result 5957 states and 9657 transitions. [2019-11-07 01:06:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:06:13,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-07 01:06:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:13,228 INFO L225 Difference]: With dead ends: 5957 [2019-11-07 01:06:13,229 INFO L226 Difference]: Without dead ends: 4512 [2019-11-07 01:06:13,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-11-07 01:06:13,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4409. [2019-11-07 01:06:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-11-07 01:06:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 7126 transitions. [2019-11-07 01:06:13,515 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 7126 transitions. Word has length 67 [2019-11-07 01:06:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:13,516 INFO L462 AbstractCegarLoop]: Abstraction has 4409 states and 7126 transitions. [2019-11-07 01:06:13,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:06:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 7126 transitions. [2019-11-07 01:06:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-07 01:06:13,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:13,520 INFO L410 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] [2019-11-07 01:06:13,520 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 306920920, now seen corresponding path program 1 times [2019-11-07 01:06:13,521 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:13,521 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846641569] [2019-11-07 01:06:13,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:13,658 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846641569] [2019-11-07 01:06:13,658 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:13,659 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:13,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098918880] [2019-11-07 01:06:13,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:13,660 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:13,660 INFO L87 Difference]: Start difference. First operand 4409 states and 7126 transitions. Second operand 4 states. [2019-11-07 01:06:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:14,006 INFO L93 Difference]: Finished difference Result 10298 states and 16697 transitions. [2019-11-07 01:06:14,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:14,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-07 01:06:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:14,050 INFO L225 Difference]: With dead ends: 10298 [2019-11-07 01:06:14,050 INFO L226 Difference]: Without dead ends: 6343 [2019-11-07 01:06:14,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-11-07 01:06:14,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 6316. [2019-11-07 01:06:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-11-07 01:06:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 10205 transitions. [2019-11-07 01:06:14,593 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 10205 transitions. Word has length 68 [2019-11-07 01:06:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:14,593 INFO L462 AbstractCegarLoop]: Abstraction has 6316 states and 10205 transitions. [2019-11-07 01:06:14,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 10205 transitions. [2019-11-07 01:06:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-07 01:06:14,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:14,605 INFO L410 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] [2019-11-07 01:06:14,608 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 872119511, now seen corresponding path program 1 times [2019-11-07 01:06:14,610 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:14,610 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372233290] [2019-11-07 01:06:14,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:14,759 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372233290] [2019-11-07 01:06:14,759 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:14,759 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:14,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793967134] [2019-11-07 01:06:14,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:14,760 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:14,761 INFO L87 Difference]: Start difference. First operand 6316 states and 10205 transitions. Second operand 4 states. [2019-11-07 01:06:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:15,390 INFO L93 Difference]: Finished difference Result 18451 states and 29920 transitions. [2019-11-07 01:06:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:15,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-07 01:06:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:15,474 INFO L225 Difference]: With dead ends: 18451 [2019-11-07 01:06:15,474 INFO L226 Difference]: Without dead ends: 12686 [2019-11-07 01:06:15,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12686 states. [2019-11-07 01:06:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12686 to 8636. [2019-11-07 01:06:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2019-11-07 01:06:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 13951 transitions. [2019-11-07 01:06:16,063 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 13951 transitions. Word has length 69 [2019-11-07 01:06:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:16,063 INFO L462 AbstractCegarLoop]: Abstraction has 8636 states and 13951 transitions. [2019-11-07 01:06:16,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 13951 transitions. [2019-11-07 01:06:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-07 01:06:16,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:16,066 INFO L410 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] [2019-11-07 01:06:16,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:16,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1806428220, now seen corresponding path program 1 times [2019-11-07 01:06:16,067 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:16,067 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487431012] [2019-11-07 01:06:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:16,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-11-07 01:06:16,126 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487431012] [2019-11-07 01:06:16,126 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:16,126 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:16,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526841418] [2019-11-07 01:06:16,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:16,127 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:16,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:16,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:16,127 INFO L87 Difference]: Start difference. First operand 8636 states and 13951 transitions. Second operand 3 states. [2019-11-07 01:06:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:16,724 INFO L93 Difference]: Finished difference Result 19227 states and 31095 transitions. [2019-11-07 01:06:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:16,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-07 01:06:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:16,758 INFO L225 Difference]: With dead ends: 19227 [2019-11-07 01:06:16,758 INFO L226 Difference]: Without dead ends: 12825 [2019-11-07 01:06:16,773 INFO L630 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-11-07 01:06:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12825 states. [2019-11-07 01:06:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12825 to 12823. [2019-11-07 01:06:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12823 states. [2019-11-07 01:06:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12823 states to 12823 states and 20604 transitions. [2019-11-07 01:06:17,404 INFO L78 Accepts]: Start accepts. Automaton has 12823 states and 20604 transitions. Word has length 70 [2019-11-07 01:06:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:17,404 INFO L462 AbstractCegarLoop]: Abstraction has 12823 states and 20604 transitions. [2019-11-07 01:06:17,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 12823 states and 20604 transitions. [2019-11-07 01:06:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-07 01:06:17,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:17,406 INFO L410 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] [2019-11-07 01:06:17,407 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash -552777714, now seen corresponding path program 1 times [2019-11-07 01:06:17,407 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:17,407 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175809990] [2019-11-07 01:06:17,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:17,473 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175809990] [2019-11-07 01:06:17,473 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:17,474 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:17,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647658237] [2019-11-07 01:06:17,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:17,475 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:17,475 INFO L87 Difference]: Start difference. First operand 12823 states and 20604 transitions. Second operand 3 states. [2019-11-07 01:06:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:18,565 INFO L93 Difference]: Finished difference Result 27737 states and 44670 transitions. [2019-11-07 01:06:18,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:18,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-07 01:06:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:18,610 INFO L225 Difference]: With dead ends: 27737 [2019-11-07 01:06:18,610 INFO L226 Difference]: Without dead ends: 18500 [2019-11-07 01:06:18,635 INFO L630 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-11-07 01:06:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18500 states. [2019-11-07 01:06:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18500 to 18498. [2019-11-07 01:06:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18498 states. [2019-11-07 01:06:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 29596 transitions. [2019-11-07 01:06:19,456 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 29596 transitions. Word has length 70 [2019-11-07 01:06:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:19,456 INFO L462 AbstractCegarLoop]: Abstraction has 18498 states and 29596 transitions. [2019-11-07 01:06:19,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 29596 transitions. [2019-11-07 01:06:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-07 01:06:19,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:19,458 INFO L410 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] [2019-11-07 01:06:19,458 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:19,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1170468960, now seen corresponding path program 1 times [2019-11-07 01:06:19,459 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:19,459 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957799932] [2019-11-07 01:06:19,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:19,511 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957799932] [2019-11-07 01:06:19,512 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:19,512 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:19,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540673640] [2019-11-07 01:06:19,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:19,513 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:19,513 INFO L87 Difference]: Start difference. First operand 18498 states and 29596 transitions. Second operand 3 states. [2019-11-07 01:06:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:20,212 INFO L93 Difference]: Finished difference Result 42427 states and 68162 transitions. [2019-11-07 01:06:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:20,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-07 01:06:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:20,283 INFO L225 Difference]: With dead ends: 42427 [2019-11-07 01:06:20,283 INFO L226 Difference]: Without dead ends: 27744 [2019-11-07 01:06:20,315 INFO L630 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-11-07 01:06:20,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27744 states. [2019-11-07 01:06:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27744 to 27742. [2019-11-07 01:06:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-11-07 01:06:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44151 transitions. [2019-11-07 01:06:21,307 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44151 transitions. Word has length 70 [2019-11-07 01:06:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:21,307 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 44151 transitions. [2019-11-07 01:06:21,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44151 transitions. [2019-11-07 01:06:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-07 01:06:21,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:21,308 INFO L410 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] [2019-11-07 01:06:21,308 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash -901408249, now seen corresponding path program 1 times [2019-11-07 01:06:21,308 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:21,308 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550765128] [2019-11-07 01:06:21,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:21,449 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550765128] [2019-11-07 01:06:21,449 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:21,449 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:21,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882436791] [2019-11-07 01:06:21,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:21,450 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:21,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:21,450 INFO L87 Difference]: Start difference. First operand 27742 states and 44151 transitions. Second operand 5 states. [2019-11-07 01:06:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:23,002 INFO L93 Difference]: Finished difference Result 57487 states and 91562 transitions. [2019-11-07 01:06:23,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:23,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-07 01:06:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:23,094 INFO L225 Difference]: With dead ends: 57487 [2019-11-07 01:06:23,094 INFO L226 Difference]: Without dead ends: 29834 [2019-11-07 01:06:23,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29834 states. [2019-11-07 01:06:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29834 to 27742. [2019-11-07 01:06:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-11-07 01:06:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44016 transitions. [2019-11-07 01:06:24,111 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44016 transitions. Word has length 71 [2019-11-07 01:06:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:24,111 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 44016 transitions. [2019-11-07 01:06:24,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44016 transitions. [2019-11-07 01:06:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-07 01:06:24,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:24,112 INFO L410 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] [2019-11-07 01:06:24,112 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 527849417, now seen corresponding path program 1 times [2019-11-07 01:06:24,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:24,113 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307048547] [2019-11-07 01:06:24,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:24,269 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307048547] [2019-11-07 01:06:24,270 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:24,270 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:24,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100417505] [2019-11-07 01:06:24,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:24,271 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:24,271 INFO L87 Difference]: Start difference. First operand 27742 states and 44016 transitions. Second operand 5 states. [2019-11-07 01:06:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:26,100 INFO L93 Difference]: Finished difference Result 89911 states and 143015 transitions. [2019-11-07 01:06:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:26,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-11-07 01:06:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:27,158 INFO L225 Difference]: With dead ends: 89911 [2019-11-07 01:06:27,159 INFO L226 Difference]: Without dead ends: 62258 [2019-11-07 01:06:27,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62258 states. [2019-11-07 01:06:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62258 to 38998. [2019-11-07 01:06:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38998 states. [2019-11-07 01:06:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38998 states to 38998 states and 61670 transitions. [2019-11-07 01:06:28,617 INFO L78 Accepts]: Start accepts. Automaton has 38998 states and 61670 transitions. Word has length 74 [2019-11-07 01:06:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:28,617 INFO L462 AbstractCegarLoop]: Abstraction has 38998 states and 61670 transitions. [2019-11-07 01:06:28,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38998 states and 61670 transitions. [2019-11-07 01:06:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-07 01:06:28,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:28,618 INFO L410 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] [2019-11-07 01:06:28,618 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -818446556, now seen corresponding path program 1 times [2019-11-07 01:06:28,618 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:28,619 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335283683] [2019-11-07 01:06:28,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:28,719 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335283683] [2019-11-07 01:06:28,719 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:28,720 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:28,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343317445] [2019-11-07 01:06:28,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:28,722 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:28,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:28,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:28,724 INFO L87 Difference]: Start difference. First operand 38998 states and 61670 transitions. Second operand 5 states. [2019-11-07 01:06:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:30,846 INFO L93 Difference]: Finished difference Result 68965 states and 108517 transitions. [2019-11-07 01:06:30,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 01:06:30,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-07 01:06:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:30,938 INFO L225 Difference]: With dead ends: 68965 [2019-11-07 01:06:30,938 INFO L226 Difference]: Without dead ends: 68963 [2019-11-07 01:06:30,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:06:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68963 states. [2019-11-07 01:06:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68963 to 39854. [2019-11-07 01:06:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39854 states. [2019-11-07 01:06:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39854 states to 39854 states and 62517 transitions. [2019-11-07 01:06:33,831 INFO L78 Accepts]: Start accepts. Automaton has 39854 states and 62517 transitions. Word has length 75 [2019-11-07 01:06:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:33,831 INFO L462 AbstractCegarLoop]: Abstraction has 39854 states and 62517 transitions. [2019-11-07 01:06:33,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 39854 states and 62517 transitions. [2019-11-07 01:06:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-07 01:06:33,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:33,834 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:33,835 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash -886490076, now seen corresponding path program 1 times [2019-11-07 01:06:33,835 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:33,835 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633313183] [2019-11-07 01:06:33,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:33,904 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633313183] [2019-11-07 01:06:33,905 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:33,905 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:33,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777158707] [2019-11-07 01:06:33,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:33,906 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:33,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:33,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:33,906 INFO L87 Difference]: Start difference. First operand 39854 states and 62517 transitions. Second operand 3 states. [2019-11-07 01:06:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:35,340 INFO L93 Difference]: Finished difference Result 73854 states and 116239 transitions. [2019-11-07 01:06:35,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:35,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-07 01:06:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:35,381 INFO L225 Difference]: With dead ends: 73854 [2019-11-07 01:06:35,381 INFO L226 Difference]: Without dead ends: 34089 [2019-11-07 01:06:35,414 INFO L630 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-11-07 01:06:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34089 states. [2019-11-07 01:06:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34089 to 34087. [2019-11-07 01:06:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34087 states. [2019-11-07 01:06:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 53532 transitions. [2019-11-07 01:06:36,833 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 53532 transitions. Word has length 101 [2019-11-07 01:06:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:36,834 INFO L462 AbstractCegarLoop]: Abstraction has 34087 states and 53532 transitions. [2019-11-07 01:06:36,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 53532 transitions. [2019-11-07 01:06:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-07 01:06:36,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:36,836 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:36,836 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1522449336, now seen corresponding path program 1 times [2019-11-07 01:06:36,837 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:36,837 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985075593] [2019-11-07 01:06:36,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:36,907 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985075593] [2019-11-07 01:06:36,907 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:36,907 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:36,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720884527] [2019-11-07 01:06:36,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:36,908 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:36,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:36,908 INFO L87 Difference]: Start difference. First operand 34087 states and 53532 transitions. Second operand 3 states. [2019-11-07 01:06:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:37,485 INFO L93 Difference]: Finished difference Result 47480 states and 74651 transitions. [2019-11-07 01:06:37,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:37,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-07 01:06:37,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:37,501 INFO L225 Difference]: With dead ends: 47480 [2019-11-07 01:06:37,501 INFO L226 Difference]: Without dead ends: 13512 [2019-11-07 01:06:37,526 INFO L630 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-11-07 01:06:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13512 states. [2019-11-07 01:06:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13512 to 13510. [2019-11-07 01:06:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13510 states. [2019-11-07 01:06:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13510 states to 13510 states and 21152 transitions. [2019-11-07 01:06:38,061 INFO L78 Accepts]: Start accepts. Automaton has 13510 states and 21152 transitions. Word has length 101 [2019-11-07 01:06:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:38,061 INFO L462 AbstractCegarLoop]: Abstraction has 13510 states and 21152 transitions. [2019-11-07 01:06:38,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13510 states and 21152 transitions. [2019-11-07 01:06:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:38,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:38,064 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:06:38,064 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:38,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:38,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1365075631, now seen corresponding path program 1 times [2019-11-07 01:06:38,065 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:38,065 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291476182] [2019-11-07 01:06:38,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:38,168 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291476182] [2019-11-07 01:06:38,174 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826491893] [2019-11-07 01:06:38,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:06:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:38,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 01:06:38,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 01:06:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 01:06:38,527 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 01:06:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 01:06:38,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 01:06:38,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-11-07 01:06:38,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705637567] [2019-11-07 01:06:38,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:38,599 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:38,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:38,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:38,600 INFO L87 Difference]: Start difference. First operand 13510 states and 21152 transitions. Second operand 5 states. [2019-11-07 01:06:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:40,032 INFO L93 Difference]: Finished difference Result 23506 states and 36922 transitions. [2019-11-07 01:06:40,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:40,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-11-07 01:06:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:40,100 INFO L225 Difference]: With dead ends: 23506 [2019-11-07 01:06:40,100 INFO L226 Difference]: Without dead ends: 15691 [2019-11-07 01:06:40,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15691 states. [2019-11-07 01:06:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15691 to 15527. [2019-11-07 01:06:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15527 states. [2019-11-07 01:06:41,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15527 states to 15527 states and 24288 transitions. [2019-11-07 01:06:41,342 INFO L78 Accepts]: Start accepts. Automaton has 15527 states and 24288 transitions. Word has length 104 [2019-11-07 01:06:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:41,342 INFO L462 AbstractCegarLoop]: Abstraction has 15527 states and 24288 transitions. [2019-11-07 01:06:41,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 01:06:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 15527 states and 24288 transitions. [2019-11-07 01:06:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 01:06:41,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:41,345 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:06:41,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 01:06:41,551 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1972121887, now seen corresponding path program 1 times [2019-11-07 01:06:41,552 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:41,552 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393665558] [2019-11-07 01:06:41,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 01:06:41,813 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393665558] [2019-11-07 01:06:41,813 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:41,813 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 01:06:41,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511864206] [2019-11-07 01:06:41,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 01:06:41,814 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:41,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 01:06:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 01:06:41,814 INFO L87 Difference]: Start difference. First operand 15527 states and 24288 transitions. Second operand 5 states.