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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:52:23,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:52:23,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:52:23,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:52:23,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:52:23,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:52:23,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:52:23,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:52:23,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:52:23,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:52:23,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:52:23,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:52:23,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:52:23,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:52:23,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:52:23,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:52:23,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:52:23,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:52:23,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:52:23,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:52:23,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:52:23,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:52:23,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:52:23,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:52:23,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:52:23,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:52:23,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:52:23,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:52:23,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:52:23,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:52:23,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:52:23,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:52:23,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:52:23,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:52:23,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:52:23,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:52:23,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:52:23,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:52:23,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:52:23,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:52:23,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:52:23,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:52:23,886 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:52:23,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:52:23,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:52:23,886 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:52:23,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:52:23,888 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:52:23,888 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:52:23,888 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:52:23,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:52:23,889 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:52:23,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:52:23,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:52:23,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:52:23,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:52:23,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:52:23,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:52:23,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:52:23,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:52:23,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:52:23,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:52:23,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:52:23,892 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:52:23,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:52:23,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:52:23,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:52:23,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:52:23,894 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:52:23,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:52:23,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:52:23,894 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:52:23,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:52:23,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:52:23,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:52:23,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:52:23,962 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:52:23,963 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:52:24,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419a9faa7/dc31772310c14ad6bb4c696f2844913b/FLAG8faeb333b [2019-09-10 07:52:24,498 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:52:24,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:52:24,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419a9faa7/dc31772310c14ad6bb4c696f2844913b/FLAG8faeb333b [2019-09-10 07:52:24,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419a9faa7/dc31772310c14ad6bb4c696f2844913b [2019-09-10 07:52:24,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:52:24,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:52:24,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:24,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:52:24,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:52:24,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:24" (1/1) ... [2019-09-10 07:52:24,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cc5af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:24, skipping insertion in model container [2019-09-10 07:52:24,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:52:24" (1/1) ... [2019-09-10 07:52:24,877 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:52:24,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:52:25,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:25,202 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:52:25,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:52:25,388 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:52:25,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25 WrapperNode [2019-09-10 07:52:25,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:52:25,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:52:25,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:52:25,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:52:25,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (1/1) ... [2019-09-10 07:52:25,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:52:25,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:52:25,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:52:25,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:52:25,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (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-09-10 07:52:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:52:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:52:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:52:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:52:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:52:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:52:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:52:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:52:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:52:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:52:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:52:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:52:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:52:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:52:26,164 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:52:26,164 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:52:26,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:26 BoogieIcfgContainer [2019-09-10 07:52:26,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:52:26,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:52:26,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:52:26,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:52:26,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:52:24" (1/3) ... [2019-09-10 07:52:26,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660c87e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:26, skipping insertion in model container [2019-09-10 07:52:26,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:52:25" (2/3) ... [2019-09-10 07:52:26,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660c87e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:52:26, skipping insertion in model container [2019-09-10 07:52:26,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:52:26" (3/3) ... [2019-09-10 07:52:26,173 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-10 07:52:26,183 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:52:26,191 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:52:26,208 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:52:26,238 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:52:26,238 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:52:26,239 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:52:26,239 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:52:26,239 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:52:26,239 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:52:26,240 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:52:26,240 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:52:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2019-09-10 07:52:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 07:52:26,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:26,288 INFO L399 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] [2019-09-10 07:52:26,289 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:26,294 INFO L82 PathProgramCache]: Analyzing trace with hash -896938852, now seen corresponding path program 1 times [2019-09-10 07:52:26,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:26,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:26,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:26,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-09-10 07:52:26,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:26,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:26,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:26,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:26,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:26,747 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 3 states. [2019-09-10 07:52:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:26,810 INFO L93 Difference]: Finished difference Result 158 states and 254 transitions. [2019-09-10 07:52:26,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:26,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 07:52:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:26,831 INFO L225 Difference]: With dead ends: 158 [2019-09-10 07:52:26,832 INFO L226 Difference]: Without dead ends: 150 [2019-09-10 07:52:26,835 INFO L628 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-09-10 07:52:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-10 07:52:26,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-10 07:52:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 07:52:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 213 transitions. [2019-09-10 07:52:26,893 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 213 transitions. Word has length 63 [2019-09-10 07:52:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:26,894 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 213 transitions. [2019-09-10 07:52:26,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2019-09-10 07:52:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 07:52:26,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:26,897 INFO L399 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-09-10 07:52:26,897 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -196255440, now seen corresponding path program 1 times [2019-09-10 07:52:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:26,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:26,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:27,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:27,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:27,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:27,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:27,031 INFO L87 Difference]: Start difference. First operand 148 states and 213 transitions. Second operand 3 states. [2019-09-10 07:52:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:27,060 INFO L93 Difference]: Finished difference Result 242 states and 360 transitions. [2019-09-10 07:52:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:27,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 07:52:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:27,063 INFO L225 Difference]: With dead ends: 242 [2019-09-10 07:52:27,064 INFO L226 Difference]: Without dead ends: 242 [2019-09-10 07:52:27,064 INFO L628 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-09-10 07:52:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-10 07:52:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2019-09-10 07:52:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 07:52:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 359 transitions. [2019-09-10 07:52:27,085 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 359 transitions. Word has length 64 [2019-09-10 07:52:27,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:27,086 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 359 transitions. [2019-09-10 07:52:27,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-09-10 07:52:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:52:27,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:27,089 INFO L399 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] [2019-09-10 07:52:27,089 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -922764682, now seen corresponding path program 1 times [2019-09-10 07:52:27,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:27,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:27,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:27,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:27,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:27,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:27,249 INFO L87 Difference]: Start difference. First operand 240 states and 359 transitions. Second operand 3 states. [2019-09-10 07:52:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:27,296 INFO L93 Difference]: Finished difference Result 410 states and 624 transitions. [2019-09-10 07:52:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:27,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:52:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:27,304 INFO L225 Difference]: With dead ends: 410 [2019-09-10 07:52:27,304 INFO L226 Difference]: Without dead ends: 410 [2019-09-10 07:52:27,306 INFO L628 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-09-10 07:52:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-10 07:52:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-10 07:52:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-10 07:52:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-10 07:52:27,354 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 65 [2019-09-10 07:52:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:27,354 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-10 07:52:27,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-10 07:52:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:52:27,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:27,357 INFO L399 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-09-10 07:52:27,357 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -919872372, now seen corresponding path program 1 times [2019-09-10 07:52:27,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:27,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:27,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:27,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:27,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:27,449 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 3 states. [2019-09-10 07:52:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:27,477 INFO L93 Difference]: Finished difference Result 714 states and 1096 transitions. [2019-09-10 07:52:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:27,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:52:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:27,484 INFO L225 Difference]: With dead ends: 714 [2019-09-10 07:52:27,484 INFO L226 Difference]: Without dead ends: 714 [2019-09-10 07:52:27,485 INFO L628 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-09-10 07:52:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-10 07:52:27,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 712. [2019-09-10 07:52:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-10 07:52:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1095 transitions. [2019-09-10 07:52:27,512 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1095 transitions. Word has length 66 [2019-09-10 07:52:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:27,514 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1095 transitions. [2019-09-10 07:52:27,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1095 transitions. [2019-09-10 07:52:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:52:27,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:27,523 INFO L399 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-09-10 07:52:27,524 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash -963358397, now seen corresponding path program 1 times [2019-09-10 07:52:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:27,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:27,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:27,624 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:27,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:27,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:27,625 INFO L87 Difference]: Start difference. First operand 712 states and 1095 transitions. Second operand 3 states. [2019-09-10 07:52:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:27,654 INFO L93 Difference]: Finished difference Result 1258 states and 1928 transitions. [2019-09-10 07:52:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:27,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:52:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:27,662 INFO L225 Difference]: With dead ends: 1258 [2019-09-10 07:52:27,662 INFO L226 Difference]: Without dead ends: 1258 [2019-09-10 07:52:27,662 INFO L628 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-09-10 07:52:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-10 07:52:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-10 07:52:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-10 07:52:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1927 transitions. [2019-09-10 07:52:27,699 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1927 transitions. Word has length 67 [2019-09-10 07:52:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:27,700 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 1927 transitions. [2019-09-10 07:52:27,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1927 transitions. [2019-09-10 07:52:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:52:27,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:27,704 INFO L399 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-09-10 07:52:27,705 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:27,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:27,705 INFO L82 PathProgramCache]: Analyzing trace with hash -295185019, now seen corresponding path program 1 times [2019-09-10 07:52:27,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:27,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:27,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:27,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:27,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:27,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:27,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:27,871 INFO L87 Difference]: Start difference. First operand 1256 states and 1927 transitions. Second operand 5 states. [2019-09-10 07:52:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:28,080 INFO L93 Difference]: Finished difference Result 2474 states and 3800 transitions. [2019-09-10 07:52:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:28,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:52:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:28,092 INFO L225 Difference]: With dead ends: 2474 [2019-09-10 07:52:28,092 INFO L226 Difference]: Without dead ends: 2474 [2019-09-10 07:52:28,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-10 07:52:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-10 07:52:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-10 07:52:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3799 transitions. [2019-09-10 07:52:28,141 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3799 transitions. Word has length 68 [2019-09-10 07:52:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:28,142 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3799 transitions. [2019-09-10 07:52:28,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3799 transitions. [2019-09-10 07:52:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:52:28,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:28,143 INFO L399 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-09-10 07:52:28,143 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1032200170, now seen corresponding path program 1 times [2019-09-10 07:52:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:28,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:28,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:28,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:28,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:28,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:28,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:28,222 INFO L87 Difference]: Start difference. First operand 2472 states and 3799 transitions. Second operand 5 states. [2019-09-10 07:52:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:28,339 INFO L93 Difference]: Finished difference Result 2472 states and 3767 transitions. [2019-09-10 07:52:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:28,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:52:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:28,351 INFO L225 Difference]: With dead ends: 2472 [2019-09-10 07:52:28,351 INFO L226 Difference]: Without dead ends: 2472 [2019-09-10 07:52:28,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-09-10 07:52:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-09-10 07:52:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-10 07:52:28,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3767 transitions. [2019-09-10 07:52:28,407 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3767 transitions. Word has length 68 [2019-09-10 07:52:28,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:28,407 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3767 transitions. [2019-09-10 07:52:28,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:28,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3767 transitions. [2019-09-10 07:52:28,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:52:28,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:28,408 INFO L399 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-09-10 07:52:28,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:28,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash -809830363, now seen corresponding path program 1 times [2019-09-10 07:52:28,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:28,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:28,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:28,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:28,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:28,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:28,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:28,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:28,503 INFO L87 Difference]: Start difference. First operand 2472 states and 3767 transitions. Second operand 5 states. [2019-09-10 07:52:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:28,660 INFO L93 Difference]: Finished difference Result 2472 states and 3735 transitions. [2019-09-10 07:52:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:28,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:52:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:28,675 INFO L225 Difference]: With dead ends: 2472 [2019-09-10 07:52:28,675 INFO L226 Difference]: Without dead ends: 2472 [2019-09-10 07:52:28,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-09-10 07:52:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-09-10 07:52:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-10 07:52:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3735 transitions. [2019-09-10 07:52:28,748 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3735 transitions. Word has length 68 [2019-09-10 07:52:28,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:28,749 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3735 transitions. [2019-09-10 07:52:28,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3735 transitions. [2019-09-10 07:52:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:52:28,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:28,750 INFO L399 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-09-10 07:52:28,751 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 464037642, now seen corresponding path program 1 times [2019-09-10 07:52:28,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:28,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:28,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:28,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:28,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:28,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:28,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:28,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:28,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:28,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:28,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:28,832 INFO L87 Difference]: Start difference. First operand 2472 states and 3735 transitions. Second operand 5 states. [2019-09-10 07:52:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:28,943 INFO L93 Difference]: Finished difference Result 2472 states and 3703 transitions. [2019-09-10 07:52:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:52:28,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 07:52:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:28,954 INFO L225 Difference]: With dead ends: 2472 [2019-09-10 07:52:28,955 INFO L226 Difference]: Without dead ends: 2472 [2019-09-10 07:52:28,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-09-10 07:52:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2472. [2019-09-10 07:52:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-10 07:52:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3703 transitions. [2019-09-10 07:52:29,005 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3703 transitions. Word has length 68 [2019-09-10 07:52:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:29,005 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3703 transitions. [2019-09-10 07:52:29,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3703 transitions. [2019-09-10 07:52:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:52:29,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:29,006 INFO L399 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-09-10 07:52:29,007 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash -982991953, now seen corresponding path program 1 times [2019-09-10 07:52:29,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:29,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:29,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:29,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:29,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:29,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:29,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:29,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:29,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:29,152 INFO L87 Difference]: Start difference. First operand 2472 states and 3703 transitions. Second operand 7 states. [2019-09-10 07:52:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:29,414 INFO L93 Difference]: Finished difference Result 19510 states and 28974 transitions. [2019-09-10 07:52:29,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:52:29,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 07:52:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:29,502 INFO L225 Difference]: With dead ends: 19510 [2019-09-10 07:52:29,502 INFO L226 Difference]: Without dead ends: 19510 [2019-09-10 07:52:29,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19510 states. [2019-09-10 07:52:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19510 to 7336. [2019-09-10 07:52:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7336 states. [2019-09-10 07:52:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10903 transitions. [2019-09-10 07:52:29,723 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10903 transitions. Word has length 68 [2019-09-10 07:52:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:29,723 INFO L475 AbstractCegarLoop]: Abstraction has 7336 states and 10903 transitions. [2019-09-10 07:52:29,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10903 transitions. [2019-09-10 07:52:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:29,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:29,725 INFO L399 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-09-10 07:52:29,725 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -635604215, now seen corresponding path program 1 times [2019-09-10 07:52:29,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:29,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:29,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:29,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:29,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:29,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:29,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:29,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:29,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:29,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:29,965 INFO L87 Difference]: Start difference. First operand 7336 states and 10903 transitions. Second operand 7 states. [2019-09-10 07:52:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:30,210 INFO L93 Difference]: Finished difference Result 9774 states and 14506 transitions. [2019-09-10 07:52:30,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:30,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-10 07:52:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:30,231 INFO L225 Difference]: With dead ends: 9774 [2019-09-10 07:52:30,231 INFO L226 Difference]: Without dead ends: 9774 [2019-09-10 07:52:30,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:52:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9774 states. [2019-09-10 07:52:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9774 to 7336. [2019-09-10 07:52:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7336 states. [2019-09-10 07:52:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10839 transitions. [2019-09-10 07:52:30,362 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10839 transitions. Word has length 70 [2019-09-10 07:52:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:30,362 INFO L475 AbstractCegarLoop]: Abstraction has 7336 states and 10839 transitions. [2019-09-10 07:52:30,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10839 transitions. [2019-09-10 07:52:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:52:30,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:30,364 INFO L399 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-09-10 07:52:30,364 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash -655653558, now seen corresponding path program 1 times [2019-09-10 07:52:30,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:30,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:30,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:30,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:52:30,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:30,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:52:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:52:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:30,445 INFO L87 Difference]: Start difference. First operand 7336 states and 10839 transitions. Second operand 3 states. [2019-09-10 07:52:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:30,485 INFO L93 Difference]: Finished difference Result 9100 states and 13314 transitions. [2019-09-10 07:52:30,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:52:30,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 07:52:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:30,504 INFO L225 Difference]: With dead ends: 9100 [2019-09-10 07:52:30,504 INFO L226 Difference]: Without dead ends: 9100 [2019-09-10 07:52:30,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:52:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9100 states. [2019-09-10 07:52:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9100 to 9098. [2019-09-10 07:52:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9098 states. [2019-09-10 07:52:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9098 states to 9098 states and 13313 transitions. [2019-09-10 07:52:30,624 INFO L78 Accepts]: Start accepts. Automaton has 9098 states and 13313 transitions. Word has length 70 [2019-09-10 07:52:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:30,625 INFO L475 AbstractCegarLoop]: Abstraction has 9098 states and 13313 transitions. [2019-09-10 07:52:30,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:52:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 9098 states and 13313 transitions. [2019-09-10 07:52:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:52:30,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:30,626 INFO L399 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-09-10 07:52:30,626 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1769196458, now seen corresponding path program 1 times [2019-09-10 07:52:30,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:30,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:30,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:30,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:30,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:52:30,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:30,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:52:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:52:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:52:30,774 INFO L87 Difference]: Start difference. First operand 9098 states and 13313 transitions. Second operand 5 states. [2019-09-10 07:52:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:30,864 INFO L93 Difference]: Finished difference Result 17670 states and 25497 transitions. [2019-09-10 07:52:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:52:30,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:52:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:30,899 INFO L225 Difference]: With dead ends: 17670 [2019-09-10 07:52:30,899 INFO L226 Difference]: Without dead ends: 17670 [2019-09-10 07:52:30,900 INFO L628 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-09-10 07:52:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-09-10 07:52:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 9514. [2019-09-10 07:52:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9514 states. [2019-09-10 07:52:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 13713 transitions. [2019-09-10 07:52:31,087 INFO L78 Accepts]: Start accepts. Automaton has 9514 states and 13713 transitions. Word has length 71 [2019-09-10 07:52:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:31,088 INFO L475 AbstractCegarLoop]: Abstraction has 9514 states and 13713 transitions. [2019-09-10 07:52:31,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:52:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9514 states and 13713 transitions. [2019-09-10 07:52:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:52:31,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:31,098 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:52:31,099 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1397736529, now seen corresponding path program 1 times [2019-09-10 07:52:31,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:31,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:31,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:31,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 07:52:31,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:31,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:31,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:31,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:31,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:31,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:31,240 INFO L87 Difference]: Start difference. First operand 9514 states and 13713 transitions. Second operand 7 states. [2019-09-10 07:52:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:31,467 INFO L93 Difference]: Finished difference Result 37364 states and 53830 transitions. [2019-09-10 07:52:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:31,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 07:52:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:31,613 INFO L225 Difference]: With dead ends: 37364 [2019-09-10 07:52:31,614 INFO L226 Difference]: Without dead ends: 37364 [2019-09-10 07:52:31,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37364 states. [2019-09-10 07:52:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37364 to 15850. [2019-09-10 07:52:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15850 states. [2019-09-10 07:52:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15850 states to 15850 states and 22689 transitions. [2019-09-10 07:52:31,988 INFO L78 Accepts]: Start accepts. Automaton has 15850 states and 22689 transitions. Word has length 97 [2019-09-10 07:52:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:31,989 INFO L475 AbstractCegarLoop]: Abstraction has 15850 states and 22689 transitions. [2019-09-10 07:52:31,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15850 states and 22689 transitions. [2019-09-10 07:52:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:52:31,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:31,997 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:52:31,997 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash 887147195, now seen corresponding path program 1 times [2019-09-10 07:52:31,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:32,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:32,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:32,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:32,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:32,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:32,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 07:52:32,145 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [124], [126], [129], [137], [139], [142], [145], [150], [152], [155], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [208], [210], [213], [216], [218], [226], [229], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 07:52:32,205 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:32,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:32,485 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:33,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:33,308 INFO L272 AbstractInterpreter]: Visited 90 different actions 784 times. Merged at 52 different actions 598 times. Widened at 22 different actions 108 times. Performed 2877 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2877 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 75 fixpoints after 16 different actions. Largest state had 134 variables. [2019-09-10 07:52:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:33,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:33,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:33,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:52:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:33,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:33,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:52:33,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:33,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:52:33,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 07:52:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:52:33,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 13 [2019-09-10 07:52:33,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:33,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:33,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:33,675 INFO L87 Difference]: Start difference. First operand 15850 states and 22689 transitions. Second operand 7 states. [2019-09-10 07:52:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:33,862 INFO L93 Difference]: Finished difference Result 30996 states and 44422 transitions. [2019-09-10 07:52:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:33,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 07:52:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:33,918 INFO L225 Difference]: With dead ends: 30996 [2019-09-10 07:52:33,918 INFO L226 Difference]: Without dead ends: 30996 [2019-09-10 07:52:33,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30996 states. [2019-09-10 07:52:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30996 to 22138. [2019-09-10 07:52:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22138 states. [2019-09-10 07:52:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22138 states to 22138 states and 31617 transitions. [2019-09-10 07:52:34,411 INFO L78 Accepts]: Start accepts. Automaton has 22138 states and 31617 transitions. Word has length 97 [2019-09-10 07:52:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:34,411 INFO L475 AbstractCegarLoop]: Abstraction has 22138 states and 31617 transitions. [2019-09-10 07:52:34,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 22138 states and 31617 transitions. [2019-09-10 07:52:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:52:34,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:34,416 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:52:34,417 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:34,417 INFO L82 PathProgramCache]: Analyzing trace with hash 910892417, now seen corresponding path program 1 times [2019-09-10 07:52:34,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:34,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:34,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:34,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:34,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:34,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2019-09-10 07:52:34,527 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 07:52:34,534 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:34,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:34,568 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:34,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:34,964 INFO L272 AbstractInterpreter]: Visited 90 different actions 666 times. Merged at 52 different actions 499 times. Widened at 21 different actions 68 times. Performed 2474 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2474 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 63 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 07:52:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:34,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:34,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:34,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:52:34,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:34,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:35,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:52:35,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:52:35,205 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:52:35,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 07:52:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 7] total 13 [2019-09-10 07:52:35,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:35,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:35,401 INFO L87 Difference]: Start difference. First operand 22138 states and 31617 transitions. Second operand 7 states. [2019-09-10 07:52:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:35,574 INFO L93 Difference]: Finished difference Result 37282 states and 53349 transitions. [2019-09-10 07:52:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:35,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 07:52:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:35,625 INFO L225 Difference]: With dead ends: 37282 [2019-09-10 07:52:35,626 INFO L226 Difference]: Without dead ends: 37282 [2019-09-10 07:52:35,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:52:35,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37282 states. [2019-09-10 07:52:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37282 to 28426. [2019-09-10 07:52:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28426 states. [2019-09-10 07:52:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28426 states to 28426 states and 40545 transitions. [2019-09-10 07:52:36,012 INFO L78 Accepts]: Start accepts. Automaton has 28426 states and 40545 transitions. Word has length 97 [2019-09-10 07:52:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:36,013 INFO L475 AbstractCegarLoop]: Abstraction has 28426 states and 40545 transitions. [2019-09-10 07:52:36,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28426 states and 40545 transitions. [2019-09-10 07:52:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:52:36,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:36,018 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:52:36,018 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash 514621301, now seen corresponding path program 1 times [2019-09-10 07:52:36,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:36,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:36,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:36,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:36,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 07:52:36,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:36,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:36,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:36,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:36,162 INFO L87 Difference]: Start difference. First operand 28426 states and 40545 transitions. Second operand 7 states. [2019-09-10 07:52:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:36,442 INFO L93 Difference]: Finished difference Result 43572 states and 62278 transitions. [2019-09-10 07:52:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:36,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 07:52:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:37,227 INFO L225 Difference]: With dead ends: 43572 [2019-09-10 07:52:37,227 INFO L226 Difference]: Without dead ends: 43572 [2019-09-10 07:52:37,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:52:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43572 states. [2019-09-10 07:52:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43572 to 34714. [2019-09-10 07:52:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34714 states. [2019-09-10 07:52:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34714 states to 34714 states and 49473 transitions. [2019-09-10 07:52:37,623 INFO L78 Accepts]: Start accepts. Automaton has 34714 states and 49473 transitions. Word has length 97 [2019-09-10 07:52:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:37,623 INFO L475 AbstractCegarLoop]: Abstraction has 34714 states and 49473 transitions. [2019-09-10 07:52:37,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:37,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34714 states and 49473 transitions. [2019-09-10 07:52:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 07:52:37,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:37,629 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:52:37,629 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1208876905, now seen corresponding path program 1 times [2019-09-10 07:52:37,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:37,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:37,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:52:37,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:52:37,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:52:37,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:52:37,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:52:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:52:37,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:52:37,760 INFO L87 Difference]: Start difference. First operand 34714 states and 49473 transitions. Second operand 7 states. [2019-09-10 07:52:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:38,015 INFO L93 Difference]: Finished difference Result 51252 states and 73590 transitions. [2019-09-10 07:52:38,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:52:38,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 07:52:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:38,073 INFO L225 Difference]: With dead ends: 51252 [2019-09-10 07:52:38,073 INFO L226 Difference]: Without dead ends: 51252 [2019-09-10 07:52:38,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:52:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51252 states. [2019-09-10 07:52:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51252 to 37274. [2019-09-10 07:52:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37274 states. [2019-09-10 07:52:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37274 states to 37274 states and 53201 transitions. [2019-09-10 07:52:38,734 INFO L78 Accepts]: Start accepts. Automaton has 37274 states and 53201 transitions. Word has length 97 [2019-09-10 07:52:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:38,734 INFO L475 AbstractCegarLoop]: Abstraction has 37274 states and 53201 transitions. [2019-09-10 07:52:38,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:52:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37274 states and 53201 transitions. [2019-09-10 07:52:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:52:38,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:38,741 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:52:38,742 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:38,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2047399003, now seen corresponding path program 1 times [2019-09-10 07:52:38,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:38,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:38,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:38,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:52:38,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:38,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:38,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 99 with the following transitions: [2019-09-10 07:52:38,837 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [124], [126], [129], [137], [139], [142], [150], [152], [155], [163], [165], [168], [171], [175], [177], [180], [181], [183], [185], [190], [192], [195], [208], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 07:52:38,840 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:38,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:38,861 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:39,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:39,396 INFO L272 AbstractInterpreter]: Visited 90 different actions 762 times. Merged at 52 different actions 567 times. Widened at 24 different actions 95 times. Performed 2844 root evaluator evaluations with a maximum evaluation depth of 7. Performed 2844 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 87 fixpoints after 22 different actions. Largest state had 134 variables. [2019-09-10 07:52:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:39,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:39,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:39,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:52:39,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:39,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:39,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:52:39,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:39,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:39,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:40,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:40,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:40,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2019-09-10 07:52:40,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:40,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:52:40,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:52:40,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:52:40,142 INFO L87 Difference]: Start difference. First operand 37274 states and 53201 transitions. Second operand 12 states. [2019-09-10 07:52:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:45,952 INFO L93 Difference]: Finished difference Result 271442 states and 376479 transitions. [2019-09-10 07:52:45,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-10 07:52:45,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-10 07:52:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:46,192 INFO L225 Difference]: With dead ends: 271442 [2019-09-10 07:52:46,193 INFO L226 Difference]: Without dead ends: 271442 [2019-09-10 07:52:46,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1432, Invalid=4420, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 07:52:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271442 states. [2019-09-10 07:52:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271442 to 152754. [2019-09-10 07:52:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152754 states. [2019-09-10 07:52:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152754 states to 152754 states and 213899 transitions. [2019-09-10 07:52:51,483 INFO L78 Accepts]: Start accepts. Automaton has 152754 states and 213899 transitions. Word has length 98 [2019-09-10 07:52:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:52:51,483 INFO L475 AbstractCegarLoop]: Abstraction has 152754 states and 213899 transitions. [2019-09-10 07:52:51,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:52:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 152754 states and 213899 transitions. [2019-09-10 07:52:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:52:51,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:52:51,494 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 07:52:51,494 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:52:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2002573344, now seen corresponding path program 1 times [2019-09-10 07:52:51,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:52:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:51,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:52:51,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:52:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:51,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:51,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:52:51,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:52:51,740 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [111], [113], [116], [119], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [276], [279], [285], [288], [291], [293], [308], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 07:52:51,746 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:52:51,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:52:51,770 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:52:52,283 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:52:52,284 INFO L272 AbstractInterpreter]: Visited 92 different actions 765 times. Merged at 54 different actions 585 times. Widened at 20 different actions 97 times. Performed 2804 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2804 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 70 fixpoints after 15 different actions. Largest state had 134 variables. [2019-09-10 07:52:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:52:52,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:52:52,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:52:52,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:52:52,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:52:52,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:52:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:52:52,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 07:52:52,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:52:52,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:52,718 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:52:52,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:52:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:52:52,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:52:52,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 07:52:52,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:52:52,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:52:52,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:52:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:52:52,984 INFO L87 Difference]: Start difference. First operand 152754 states and 213899 transitions. Second operand 17 states. [2019-09-10 07:52:54,542 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-09-10 07:52:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:52:58,687 INFO L93 Difference]: Finished difference Result 672016 states and 929914 transitions. [2019-09-10 07:52:58,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:52:58,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2019-09-10 07:52:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:52:59,498 INFO L225 Difference]: With dead ends: 672016 [2019-09-10 07:52:59,498 INFO L226 Difference]: Without dead ends: 672016 [2019-09-10 07:52:59,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=616, Invalid=1736, Unknown=0, NotChecked=0, Total=2352 [2019-09-10 07:53:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672016 states. [2019-09-10 07:53:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672016 to 319246. [2019-09-10 07:53:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319246 states. [2019-09-10 07:53:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319246 states to 319246 states and 445657 transitions. [2019-09-10 07:53:08,811 INFO L78 Accepts]: Start accepts. Automaton has 319246 states and 445657 transitions. Word has length 99 [2019-09-10 07:53:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:53:08,812 INFO L475 AbstractCegarLoop]: Abstraction has 319246 states and 445657 transitions. [2019-09-10 07:53:08,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 07:53:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 319246 states and 445657 transitions. [2019-09-10 07:53:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:53:08,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:53:08,826 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 07:53:08,826 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:53:08,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1012996838, now seen corresponding path program 1 times [2019-09-10 07:53:08,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:53:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:53:08,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:53:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:09,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:09,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:53:09,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2019-09-10 07:53:09,021 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [111], [113], [116], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [283], [285], [288], [291], [293], [301], [304], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 07:53:09,027 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:53:09,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:53:09,054 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:53:13,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:53:13,125 INFO L272 AbstractInterpreter]: Visited 92 different actions 704 times. Merged at 54 different actions 534 times. Widened at 19 different actions 89 times. Performed 2554 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 67 fixpoints after 18 different actions. Largest state had 134 variables. [2019-09-10 07:53:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:53:13,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:53:13,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:53:13,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:53:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:53:13,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:53:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:53:13,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:53:13,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:53:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:53:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:13,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:53:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:53:14,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:53:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 07:53:14,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:53:14,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 07:53:14,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 07:53:14,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:53:14,323 INFO L87 Difference]: Start difference. First operand 319246 states and 445657 transitions. Second operand 20 states. [2019-09-10 07:53:20,713 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-10 07:53:21,262 WARN L188 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 07:53:22,355 WARN L188 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 07:53:23,214 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:53:25,269 WARN L188 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:53:30,584 WARN L188 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-09-10 07:53:32,111 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:53:32,736 WARN L188 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-10 07:53:33,946 WARN L188 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-09-10 07:53:34,195 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:53:34,383 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:53:34,542 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:53:34,712 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:53:36,148 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 07:53:37,380 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:53:38,264 WARN L188 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 07:53:38,920 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:53:39,337 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:53:39,505 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:53:43,012 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 07:53:44,028 WARN L188 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 07:53:44,480 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-10 07:53:44,638 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-10 07:53:45,783 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-09-10 07:53:47,934 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 07:54:00,093 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 07:54:00,580 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:54:01,843 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-10 07:54:03,532 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 07:54:03,752 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 07:54:04,281 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-09-10 07:54:05,739 WARN L188 SmtUtils]: Spent 820.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 07:54:08,139 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 07:54:09,457 WARN L188 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-10 07:54:10,104 WARN L188 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-09-10 07:54:11,119 WARN L188 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-09-10 07:54:13,454 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 07:54:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:54:32,826 INFO L93 Difference]: Finished difference Result 2651866 states and 3622995 transitions. [2019-09-10 07:54:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2019-09-10 07:54:32,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-09-10 07:54:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:54:38,062 INFO L225 Difference]: With dead ends: 2651866 [2019-09-10 07:54:38,063 INFO L226 Difference]: Without dead ends: 2651866 [2019-09-10 07:54:38,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30300 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=10465, Invalid=62165, Unknown=0, NotChecked=0, Total=72630 [2019-09-10 07:54:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651866 states. [2019-09-10 07:55:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651866 to 538988. [2019-09-10 07:55:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538988 states. [2019-09-10 07:55:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538988 states to 538988 states and 748497 transitions. [2019-09-10 07:55:16,688 INFO L78 Accepts]: Start accepts. Automaton has 538988 states and 748497 transitions. Word has length 99 [2019-09-10 07:55:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:16,688 INFO L475 AbstractCegarLoop]: Abstraction has 538988 states and 748497 transitions. [2019-09-10 07:55:16,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 07:55:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 538988 states and 748497 transitions. [2019-09-10 07:55:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:55:16,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:16,703 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:55:16,704 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash -764347023, now seen corresponding path program 1 times [2019-09-10 07:55:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:16,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:16,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:16,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:16,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:16,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:55:16,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:55:16,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:55:16,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:55:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:55:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:55:16,769 INFO L87 Difference]: Start difference. First operand 538988 states and 748497 transitions. Second operand 3 states. [2019-09-10 07:55:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:55:19,226 INFO L93 Difference]: Finished difference Result 321927 states and 442760 transitions. [2019-09-10 07:55:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:55:19,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:55:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:55:19,517 INFO L225 Difference]: With dead ends: 321927 [2019-09-10 07:55:19,517 INFO L226 Difference]: Without dead ends: 321927 [2019-09-10 07:55:19,518 INFO L628 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-09-10 07:55:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321927 states. [2019-09-10 07:55:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321927 to 299873. [2019-09-10 07:55:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299873 states. [2019-09-10 07:55:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299873 states to 299873 states and 416575 transitions. [2019-09-10 07:55:27,725 INFO L78 Accepts]: Start accepts. Automaton has 299873 states and 416575 transitions. Word has length 100 [2019-09-10 07:55:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:55:27,726 INFO L475 AbstractCegarLoop]: Abstraction has 299873 states and 416575 transitions. [2019-09-10 07:55:27,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:55:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 299873 states and 416575 transitions. [2019-09-10 07:55:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:55:27,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:55:27,735 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-10 07:55:27,735 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:55:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:27,736 INFO L82 PathProgramCache]: Analyzing trace with hash -628391631, now seen corresponding path program 1 times [2019-09-10 07:55:27,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:55:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:27,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:55:27,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:55:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:27,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:27,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:55:27,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:55:27,917 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [100], [103], [106], [109], [111], [113], [116], [119], [124], [126], [129], [137], [139], [142], [150], [152], [155], [158], [163], [165], [168], [175], [177], [180], [181], [183], [192], [195], [199], [201], [204], [210], [213], [216], [218], [233], [235], [238], [241], [243], [258], [260], [263], [266], [268], [276], [279], [285], [288], [291], [293], [310], [313], [316], [318], [360], [361], [365], [366], [367] [2019-09-10 07:55:27,923 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:55:27,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:55:27,940 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:55:28,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:55:28,309 INFO L272 AbstractInterpreter]: Visited 93 different actions 756 times. Merged at 55 different actions 581 times. Widened at 16 different actions 68 times. Performed 2714 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2714 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 69 fixpoints after 19 different actions. Largest state had 134 variables. [2019-09-10 07:55:28,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:55:28,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:55:28,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:55:28,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:55:28,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:55:28,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:55:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:55:28,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 07:55:28,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:55:28,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:28,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:55:28,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:55:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:55:29,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:55:29,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 07:55:29,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:55:29,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 07:55:29,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 07:55:29,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:55:29,015 INFO L87 Difference]: Start difference. First operand 299873 states and 416575 transitions. Second operand 17 states. [2019-09-10 07:55:34,571 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-10 07:55:53,637 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-10 07:56:01,839 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 07:56:02,435 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 07:56:07,890 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-10 07:57:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:57:08,228 INFO L93 Difference]: Finished difference Result 7217139 states and 9786290 transitions. [2019-09-10 07:57:08,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 294 states. [2019-09-10 07:57:08,228 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 100 [2019-09-10 07:57:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:57:38,360 INFO L225 Difference]: With dead ends: 7217139 [2019-09-10 07:57:38,360 INFO L226 Difference]: Without dead ends: 7217139 [2019-09-10 07:57:38,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43101 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=11547, Invalid=86735, Unknown=0, NotChecked=0, Total=98282 [2019-09-10 07:57:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217139 states.