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/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:07,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:07,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:07,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:07,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:07,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:07,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:07,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:07,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:07,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:07,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:07,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:07,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:07,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:07,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:07,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:07,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:07,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:07,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:07,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:07,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:07,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:07,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:07,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:07,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:07,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:07,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:07,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:07,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:07,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:07,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:07,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:07,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:07,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:07,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:07,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:07,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:07,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:07,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:07,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:07,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:07,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:05:07,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:07,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:07,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:07,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:07,846 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:07,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:07,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:07,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:07,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:07,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:07,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:07,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:07,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:07,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:07,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:07,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:07,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:07,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:07,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:07,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:07,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:07,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:07,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:07,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:07,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:07,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:07,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:07,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:07,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:08,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:08,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:08,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:08,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:08,192 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:08,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-15 01:05:08,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7757a4ae1/f2c5c4fea4524aca8adcd7dbcc5142ae/FLAG1b54f835b [2019-10-15 01:05:08,916 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:08,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-15 01:05:08,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7757a4ae1/f2c5c4fea4524aca8adcd7dbcc5142ae/FLAG1b54f835b [2019-10-15 01:05:09,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7757a4ae1/f2c5c4fea4524aca8adcd7dbcc5142ae [2019-10-15 01:05:09,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:09,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:09,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:09,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:09,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:09,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:09" (1/1) ... [2019-10-15 01:05:09,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62648d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:09, skipping insertion in model container [2019-10-15 01:05:09,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:09" (1/1) ... [2019-10-15 01:05:09,133 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:09,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:10,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:10,244 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:10,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:10,562 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:10,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10 WrapperNode [2019-10-15 01:05:10,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:10,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:10,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:10,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:10,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... [2019-10-15 01:05:10,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:10,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:10,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:10,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:10,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:10,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:10,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:10,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:10,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:13,398 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:13,399 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:05:13,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:13 BoogieIcfgContainer [2019-10-15 01:05:13,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:13,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:13,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:13,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:13,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:09" (1/3) ... [2019-10-15 01:05:13,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32417b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:13, skipping insertion in model container [2019-10-15 01:05:13,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:10" (2/3) ... [2019-10-15 01:05:13,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32417b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:13, skipping insertion in model container [2019-10-15 01:05:13,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:13" (3/3) ... [2019-10-15 01:05:13,411 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-10-15 01:05:13,423 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:13,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-15 01:05:13,445 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-15 01:05:13,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:13,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:13,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:13,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:13,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:13,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:13,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:13,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-10-15 01:05:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 01:05:13,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:13,518 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:13,520 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:13,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-10-15 01:05:13,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:13,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451243697] [2019-10-15 01:05:13,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:13,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:13,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451243697] [2019-10-15 01:05:13,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:13,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:13,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185835455] [2019-10-15 01:05:13,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:13,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:13,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:13,812 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-10-15 01:05:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:15,334 INFO L93 Difference]: Finished difference Result 490 states and 915 transitions. [2019-10-15 01:05:15,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:15,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 01:05:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:15,351 INFO L225 Difference]: With dead ends: 490 [2019-10-15 01:05:15,352 INFO L226 Difference]: Without dead ends: 301 [2019-10-15 01:05:15,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-15 01:05:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-10-15 01:05:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-15 01:05:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-10-15 01:05:15,421 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-10-15 01:05:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:15,422 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-10-15 01:05:15,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-10-15 01:05:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 01:05:15,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:15,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:15,424 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-10-15 01:05:15,424 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:15,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82771301] [2019-10-15 01:05:15,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:15,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82771301] [2019-10-15 01:05:15,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:15,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:15,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944820618] [2019-10-15 01:05:15,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:15,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:15,526 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-10-15 01:05:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:15,938 INFO L93 Difference]: Finished difference Result 301 states and 364 transitions. [2019-10-15 01:05:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:15,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 01:05:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:15,943 INFO L225 Difference]: With dead ends: 301 [2019-10-15 01:05:15,943 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:05:15,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:05:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-10-15 01:05:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-15 01:05:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-10-15 01:05:15,962 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-10-15 01:05:15,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:15,963 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-10-15 01:05:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-10-15 01:05:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-15 01:05:15,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:15,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:15,976 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-10-15 01:05:15,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:15,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660680252] [2019-10-15 01:05:15,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:15,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:18,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660680252] [2019-10-15 01:05:18,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:18,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-15 01:05:18,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808192684] [2019-10-15 01:05:18,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-15 01:05:18,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:18,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-15 01:05:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-10-15 01:05:18,581 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-10-15 01:05:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:20,137 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2019-10-15 01:05:20,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-15 01:05:20,139 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-10-15 01:05:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:20,143 INFO L225 Difference]: With dead ends: 297 [2019-10-15 01:05:20,144 INFO L226 Difference]: Without dead ends: 295 [2019-10-15 01:05:20,147 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-10-15 01:05:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-15 01:05:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-10-15 01:05:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-15 01:05:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-10-15 01:05:20,185 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-10-15 01:05:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:20,187 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-10-15 01:05:20,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-15 01:05:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-10-15 01:05:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-15 01:05:20,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:20,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:20,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-10-15 01:05:20,200 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:20,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006946379] [2019-10-15 01:05:20,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:20,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:21,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006946379] [2019-10-15 01:05:21,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:21,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:21,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726379478] [2019-10-15 01:05:21,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:21,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:21,385 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-10-15 01:05:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:21,959 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-10-15 01:05:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:21,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-10-15 01:05:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:21,965 INFO L225 Difference]: With dead ends: 296 [2019-10-15 01:05:21,965 INFO L226 Difference]: Without dead ends: 294 [2019-10-15 01:05:21,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-15 01:05:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-10-15 01:05:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-15 01:05:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-10-15 01:05:21,976 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-10-15 01:05:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:21,977 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-10-15 01:05:21,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-10-15 01:05:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-15 01:05:21,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:21,982 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:21,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:21,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:21,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-10-15 01:05:21,983 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:21,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661462444] [2019-10-15 01:05:21,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:21,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:21,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:24,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661462444] [2019-10-15 01:05:24,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:24,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-15 01:05:24,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016768340] [2019-10-15 01:05:24,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-15 01:05:24,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:24,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-15 01:05:24,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-15 01:05:24,464 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-10-15 01:05:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:26,157 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-10-15 01:05:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 01:05:26,157 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-10-15 01:05:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:26,161 INFO L225 Difference]: With dead ends: 295 [2019-10-15 01:05:26,161 INFO L226 Difference]: Without dead ends: 293 [2019-10-15 01:05:26,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 01:05:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-15 01:05:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-10-15 01:05:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-15 01:05:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-10-15 01:05:26,171 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-10-15 01:05:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:26,172 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-10-15 01:05:26,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-15 01:05:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-10-15 01:05:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-15 01:05:26,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:26,176 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:26,177 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-10-15 01:05:26,177 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:26,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132631039] [2019-10-15 01:05:26,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:26,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:26,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:27,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132631039] [2019-10-15 01:05:27,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:27,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:27,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233607751] [2019-10-15 01:05:27,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:27,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:27,125 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-10-15 01:05:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:27,797 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2019-10-15 01:05:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:27,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-10-15 01:05:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:27,801 INFO L225 Difference]: With dead ends: 290 [2019-10-15 01:05:27,801 INFO L226 Difference]: Without dead ends: 288 [2019-10-15 01:05:27,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:05:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-15 01:05:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-10-15 01:05:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-10-15 01:05:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-10-15 01:05:27,810 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-10-15 01:05:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:27,811 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-10-15 01:05:27,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-10-15 01:05:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-15 01:05:27,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:27,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:27,815 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:27,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-10-15 01:05:27,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:27,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877512542] [2019-10-15 01:05:27,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:27,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:27,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:29,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877512542] [2019-10-15 01:05:29,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:29,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-15 01:05:29,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029476185] [2019-10-15 01:05:29,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-15 01:05:29,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-15 01:05:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 01:05:29,830 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 66 states. [2019-10-15 01:05:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:31,431 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2019-10-15 01:05:31,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-15 01:05:31,432 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 255 [2019-10-15 01:05:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:31,435 INFO L225 Difference]: With dead ends: 298 [2019-10-15 01:05:31,435 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:05:31,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-15 01:05:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:05:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 286. [2019-10-15 01:05:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-15 01:05:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-10-15 01:05:31,445 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-10-15 01:05:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:31,446 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-10-15 01:05:31,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-15 01:05:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-10-15 01:05:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-15 01:05:31,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:31,450 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:31,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-10-15 01:05:31,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:31,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897365378] [2019-10-15 01:05:31,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:31,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:31,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:31,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897365378] [2019-10-15 01:05:31,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:31,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:05:31,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900525279] [2019-10-15 01:05:31,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:05:31,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:05:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:05:31,671 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-10-15 01:05:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:32,007 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-10-15 01:05:32,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:05:32,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-10-15 01:05:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:32,010 INFO L225 Difference]: With dead ends: 286 [2019-10-15 01:05:32,011 INFO L226 Difference]: Without dead ends: 282 [2019-10-15 01:05:32,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-15 01:05:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-10-15 01:05:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-10-15 01:05:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-10-15 01:05:32,019 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-10-15 01:05:32,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:32,020 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-10-15 01:05:32,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:05:32,020 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-10-15 01:05:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-15 01:05:32,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:32,022 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:32,022 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:32,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-10-15 01:05:32,023 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:32,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644835291] [2019-10-15 01:05:32,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:32,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:32,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:34,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644835291] [2019-10-15 01:05:34,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:34,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-15 01:05:34,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619829666] [2019-10-15 01:05:34,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-15 01:05:34,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-15 01:05:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 01:05:34,143 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-10-15 01:05:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:35,378 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2019-10-15 01:05:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-15 01:05:35,380 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-10-15 01:05:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:35,381 INFO L225 Difference]: With dead ends: 292 [2019-10-15 01:05:35,382 INFO L226 Difference]: Without dead ends: 290 [2019-10-15 01:05:35,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-15 01:05:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-15 01:05:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-10-15 01:05:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-15 01:05:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-10-15 01:05:35,390 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-10-15 01:05:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:35,391 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-10-15 01:05:35,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-15 01:05:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-10-15 01:05:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-15 01:05:35,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:35,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:35,394 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-10-15 01:05:35,395 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:35,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643127992] [2019-10-15 01:05:35,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:35,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:35,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:37,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643127992] [2019-10-15 01:05:37,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:37,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-15 01:05:37,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310783788] [2019-10-15 01:05:37,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-15 01:05:37,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-15 01:05:37,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-15 01:05:37,407 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-10-15 01:05:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:38,923 INFO L93 Difference]: Finished difference Result 298 states and 303 transitions. [2019-10-15 01:05:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 01:05:38,924 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-10-15 01:05:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:38,927 INFO L225 Difference]: With dead ends: 298 [2019-10-15 01:05:38,927 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:05:38,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 01:05:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:05:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-10-15 01:05:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-15 01:05:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-10-15 01:05:38,936 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-10-15 01:05:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:38,937 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-10-15 01:05:38,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-15 01:05:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-10-15 01:05:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-15 01:05:38,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:38,939 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:38,939 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:38,940 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-10-15 01:05:38,940 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:38,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934450852] [2019-10-15 01:05:38,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:38,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:38,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:40,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934450852] [2019-10-15 01:05:40,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:40,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-15 01:05:40,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685947295] [2019-10-15 01:05:40,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-15 01:05:40,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-15 01:05:40,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-15 01:05:40,692 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-10-15 01:05:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:42,238 INFO L93 Difference]: Finished difference Result 301 states and 306 transitions. [2019-10-15 01:05:42,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 01:05:42,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-10-15 01:05:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:42,245 INFO L225 Difference]: With dead ends: 301 [2019-10-15 01:05:42,245 INFO L226 Difference]: Without dead ends: 299 [2019-10-15 01:05:42,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-15 01:05:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-15 01:05:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-10-15 01:05:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-15 01:05:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-10-15 01:05:42,254 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-10-15 01:05:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:42,255 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-10-15 01:05:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-15 01:05:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-10-15 01:05:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-15 01:05:42,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:42,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:42,258 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-10-15 01:05:42,259 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:42,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162671765] [2019-10-15 01:05:42,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:42,259 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:42,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat