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_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:39:42,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:39:42,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:39:42,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:39:42,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:39:42,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:39:42,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:39:42,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:39:42,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:39:42,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:39:42,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:39:42,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:39:42,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:39:42,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:39:42,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:39:42,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:39:42,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:39:42,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:39:42,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:39:42,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:39:42,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:39:42,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:39:42,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:39:42,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:39:42,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:39:42,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:39:42,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:39:42,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:39:42,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:39:42,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:39:42,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:39:42,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:39:42,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:39:42,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:39:42,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:39:42,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:39:42,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:39:42,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:39:42,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:39:42,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:39:42,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:39:42,214 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 08:39:42,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:39:42,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:39:42,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:39:42,230 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:39:42,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:39:42,231 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:39:42,231 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:39:42,231 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:39:42,232 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:39:42,232 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:39:42,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:39:42,233 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:39:42,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:39:42,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:39:42,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:39:42,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:39:42,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:39:42,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:39:42,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:39:42,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:39:42,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:39:42,235 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:39:42,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:39:42,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:39:42,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:39:42,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:39:42,236 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:39:42,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:39:42,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:39:42,236 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:39:42,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:39:42,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:39:42,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:39:42,286 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:39:42,287 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:39:42,288 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:39:42,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a0c2dfb/7a2b396c448a4ad2b9bc02f34b638b55/FLAGce83e9643 [2019-09-10 08:39:42,872 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:39:42,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:39:42,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a0c2dfb/7a2b396c448a4ad2b9bc02f34b638b55/FLAGce83e9643 [2019-09-10 08:39:43,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a0c2dfb/7a2b396c448a4ad2b9bc02f34b638b55 [2019-09-10 08:39:43,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:39:43,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:39:43,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:39:43,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:39:43,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:39:43,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a379ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43, skipping insertion in model container [2019-09-10 08:39:43,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,206 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:39:43,265 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:39:43,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:39:43,605 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:39:43,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:39:43,807 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:39:43,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43 WrapperNode [2019-09-10 08:39:43,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:39:43,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:39:43,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:39:43,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:39:43,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (1/1) ... [2019-09-10 08:39:43,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:39:43,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:39:43,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:39:43,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:39:43,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (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 08:39:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:39:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:39:43,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:39:43,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:39:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:39:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:39:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:39:43,926 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:39:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:39:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:39:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:39:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:39:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:39:43,927 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:39:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:39:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:39:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:39:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:39:43,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:39:44,747 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:39:44,748 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:39:44,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:39:44 BoogieIcfgContainer [2019-09-10 08:39:44,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:39:44,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:39:44,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:39:44,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:39:44,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:39:43" (1/3) ... [2019-09-10 08:39:44,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2fddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:39:44, skipping insertion in model container [2019-09-10 08:39:44,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:39:43" (2/3) ... [2019-09-10 08:39:44,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2fddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:39:44, skipping insertion in model container [2019-09-10 08:39:44,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:39:44" (3/3) ... [2019-09-10 08:39:44,761 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:39:44,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:39:44,792 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:39:44,808 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:39:44,829 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:39:44,829 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:39:44,830 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:39:44,830 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:39:44,830 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:39:44,830 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:39:44,830 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:39:44,830 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:39:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-10 08:39:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:39:44,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:44,866 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 08:39:44,868 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash 170153311, now seen corresponding path program 1 times [2019-09-10 08:39:44,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:44,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:45,346 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 08:39:45,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:45,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:45,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:45,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:45,373 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-09-10 08:39:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:45,513 INFO L93 Difference]: Finished difference Result 249 states and 408 transitions. [2019-09-10 08:39:45,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:45,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:39:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:45,528 INFO L225 Difference]: With dead ends: 249 [2019-09-10 08:39:45,528 INFO L226 Difference]: Without dead ends: 241 [2019-09-10 08:39:45,530 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 08:39:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-10 08:39:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-10 08:39:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-10 08:39:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2019-09-10 08:39:45,595 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 66 [2019-09-10 08:39:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:45,596 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2019-09-10 08:39:45,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2019-09-10 08:39:45,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:39:45,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:45,601 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 08:39:45,601 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash -340326208, now seen corresponding path program 1 times [2019-09-10 08:39:45,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:45,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:45,813 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 08:39:45,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:45,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:45,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:45,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:45,818 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand 3 states. [2019-09-10 08:39:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:45,862 INFO L93 Difference]: Finished difference Result 399 states and 627 transitions. [2019-09-10 08:39:45,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:45,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:39:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:45,866 INFO L225 Difference]: With dead ends: 399 [2019-09-10 08:39:45,867 INFO L226 Difference]: Without dead ends: 399 [2019-09-10 08:39:45,868 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 08:39:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-10 08:39:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2019-09-10 08:39:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-10 08:39:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 624 transitions. [2019-09-10 08:39:45,900 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 624 transitions. Word has length 68 [2019-09-10 08:39:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:45,901 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 624 transitions. [2019-09-10 08:39:45,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2019-09-10 08:39:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:39:45,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:45,905 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 08:39:45,908 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1584902111, now seen corresponding path program 1 times [2019-09-10 08:39:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:45,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:46,047 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 08:39:46,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:46,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:46,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:46,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:46,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:46,051 INFO L87 Difference]: Start difference. First operand 395 states and 624 transitions. Second operand 3 states. [2019-09-10 08:39:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:46,089 INFO L93 Difference]: Finished difference Result 697 states and 1105 transitions. [2019-09-10 08:39:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:46,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:39:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:46,099 INFO L225 Difference]: With dead ends: 697 [2019-09-10 08:39:46,099 INFO L226 Difference]: Without dead ends: 697 [2019-09-10 08:39:46,100 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 08:39:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-10 08:39:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2019-09-10 08:39:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-10 08:39:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1100 transitions. [2019-09-10 08:39:46,157 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1100 transitions. Word has length 70 [2019-09-10 08:39:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:46,158 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1100 transitions. [2019-09-10 08:39:46,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1100 transitions. [2019-09-10 08:39:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:39:46,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:46,163 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, 1] [2019-09-10 08:39:46,164 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash 834475330, now seen corresponding path program 1 times [2019-09-10 08:39:46,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:46,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:46,372 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 08:39:46,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:46,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:46,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:46,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:46,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:46,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:46,376 INFO L87 Difference]: Start difference. First operand 691 states and 1100 transitions. Second operand 5 states. [2019-09-10 08:39:46,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:46,609 INFO L93 Difference]: Finished difference Result 2353 states and 3811 transitions. [2019-09-10 08:39:46,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:39:46,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:39:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:46,624 INFO L225 Difference]: With dead ends: 2353 [2019-09-10 08:39:46,624 INFO L226 Difference]: Without dead ends: 2353 [2019-09-10 08:39:46,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:39:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-09-10 08:39:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1243. [2019-09-10 08:39:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-09-10 08:39:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1995 transitions. [2019-09-10 08:39:46,685 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1995 transitions. Word has length 72 [2019-09-10 08:39:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:46,688 INFO L475 AbstractCegarLoop]: Abstraction has 1243 states and 1995 transitions. [2019-09-10 08:39:46,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1995 transitions. [2019-09-10 08:39:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:39:46,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:46,694 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, 1, 1] [2019-09-10 08:39:46,694 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:46,694 INFO L82 PathProgramCache]: Analyzing trace with hash 37321009, now seen corresponding path program 1 times [2019-09-10 08:39:46,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:46,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:46,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:46,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:46,809 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 08:39:46,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:46,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:39:46,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:46,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:39:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:39:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:46,811 INFO L87 Difference]: Start difference. First operand 1243 states and 1995 transitions. Second operand 4 states. [2019-09-10 08:39:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:46,898 INFO L93 Difference]: Finished difference Result 2441 states and 3961 transitions. [2019-09-10 08:39:46,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:39:46,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 08:39:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:46,913 INFO L225 Difference]: With dead ends: 2441 [2019-09-10 08:39:46,913 INFO L226 Difference]: Without dead ends: 2441 [2019-09-10 08:39:46,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-09-10 08:39:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1833. [2019-09-10 08:39:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-09-10 08:39:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2956 transitions. [2019-09-10 08:39:46,999 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2956 transitions. Word has length 73 [2019-09-10 08:39:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:47,000 INFO L475 AbstractCegarLoop]: Abstraction has 1833 states and 2956 transitions. [2019-09-10 08:39:47,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:39:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2956 transitions. [2019-09-10 08:39:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:39:47,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:47,004 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, 1, 1, 1] [2019-09-10 08:39:47,004 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:47,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1099898857, now seen corresponding path program 1 times [2019-09-10 08:39:47,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:47,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:47,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:47,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:47,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:47,144 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 08:39:47,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:47,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:39:47,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:47,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:39:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:39:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:39:47,146 INFO L87 Difference]: Start difference. First operand 1833 states and 2956 transitions. Second operand 7 states. [2019-09-10 08:39:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:47,380 INFO L93 Difference]: Finished difference Result 6240 states and 10045 transitions. [2019-09-10 08:39:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:39:47,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 08:39:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:47,410 INFO L225 Difference]: With dead ends: 6240 [2019-09-10 08:39:47,411 INFO L226 Difference]: Without dead ends: 6240 [2019-09-10 08:39:47,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:39:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6240 states. [2019-09-10 08:39:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6240 to 6091. [2019-09-10 08:39:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6091 states. [2019-09-10 08:39:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 9828 transitions. [2019-09-10 08:39:47,571 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 9828 transitions. Word has length 74 [2019-09-10 08:39:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:47,571 INFO L475 AbstractCegarLoop]: Abstraction has 6091 states and 9828 transitions. [2019-09-10 08:39:47,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:39:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 9828 transitions. [2019-09-10 08:39:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:39:47,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:47,574 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, 1, 1, 1, 1] [2019-09-10 08:39:47,575 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash -315368200, now seen corresponding path program 1 times [2019-09-10 08:39:47,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:47,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:47,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:47,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:47,670 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 08:39:47,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:47,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:39:47,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:47,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:39:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:39:47,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:47,673 INFO L87 Difference]: Start difference. First operand 6091 states and 9828 transitions. Second operand 4 states. [2019-09-10 08:39:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:47,903 INFO L93 Difference]: Finished difference Result 12234 states and 19800 transitions. [2019-09-10 08:39:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:39:47,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:39:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:47,986 INFO L225 Difference]: With dead ends: 12234 [2019-09-10 08:39:47,986 INFO L226 Difference]: Without dead ends: 12234 [2019-09-10 08:39:47,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:39:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12234 states. [2019-09-10 08:39:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12234 to 8666. [2019-09-10 08:39:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-09-10 08:39:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 13985 transitions. [2019-09-10 08:39:48,246 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 13985 transitions. Word has length 75 [2019-09-10 08:39:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:48,246 INFO L475 AbstractCegarLoop]: Abstraction has 8666 states and 13985 transitions. [2019-09-10 08:39:48,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:39:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 13985 transitions. [2019-09-10 08:39:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:39:48,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:48,254 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, 1, 1, 1, 1, 1] [2019-09-10 08:39:48,255 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:48,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:48,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1167797200, now seen corresponding path program 1 times [2019-09-10 08:39:48,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:48,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:48,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:48,322 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 08:39:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:48,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:48,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:48,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:48,325 INFO L87 Difference]: Start difference. First operand 8666 states and 13985 transitions. Second operand 3 states. [2019-09-10 08:39:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:48,395 INFO L93 Difference]: Finished difference Result 12910 states and 20798 transitions. [2019-09-10 08:39:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:48,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:39:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:48,429 INFO L225 Difference]: With dead ends: 12910 [2019-09-10 08:39:48,429 INFO L226 Difference]: Without dead ends: 12910 [2019-09-10 08:39:48,429 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 08:39:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12910 states. [2019-09-10 08:39:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12910 to 12908. [2019-09-10 08:39:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12908 states. [2019-09-10 08:39:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 20797 transitions. [2019-09-10 08:39:48,750 INFO L78 Accepts]: Start accepts. Automaton has 12908 states and 20797 transitions. Word has length 76 [2019-09-10 08:39:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:48,751 INFO L475 AbstractCegarLoop]: Abstraction has 12908 states and 20797 transitions. [2019-09-10 08:39:48,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 12908 states and 20797 transitions. [2019-09-10 08:39:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:39:48,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:48,752 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, 1, 1, 1, 1, 1] [2019-09-10 08:39:48,753 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1289808927, now seen corresponding path program 1 times [2019-09-10 08:39:48,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:48,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:48,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:48,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:48,811 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 08:39:48,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:48,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:48,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:48,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:48,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:48,813 INFO L87 Difference]: Start difference. First operand 12908 states and 20797 transitions. Second operand 3 states. [2019-09-10 08:39:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:48,898 INFO L93 Difference]: Finished difference Result 19264 states and 30826 transitions. [2019-09-10 08:39:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:48,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:39:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:48,939 INFO L225 Difference]: With dead ends: 19264 [2019-09-10 08:39:48,939 INFO L226 Difference]: Without dead ends: 19264 [2019-09-10 08:39:48,939 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 08:39:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19264 states. [2019-09-10 08:39:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19264 to 19262. [2019-09-10 08:39:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19262 states. [2019-09-10 08:39:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19262 states to 19262 states and 30825 transitions. [2019-09-10 08:39:49,209 INFO L78 Accepts]: Start accepts. Automaton has 19262 states and 30825 transitions. Word has length 76 [2019-09-10 08:39:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:49,210 INFO L475 AbstractCegarLoop]: Abstraction has 19262 states and 30825 transitions. [2019-09-10 08:39:49,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19262 states and 30825 transitions. [2019-09-10 08:39:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:39:49,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:49,212 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, 1, 1, 1, 1, 1] [2019-09-10 08:39:49,212 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:49,213 INFO L82 PathProgramCache]: Analyzing trace with hash -645952435, now seen corresponding path program 1 times [2019-09-10 08:39:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:49,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:49,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:49,295 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 08:39:49,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:49,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:49,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:49,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:49,297 INFO L87 Difference]: Start difference. First operand 19262 states and 30825 transitions. Second operand 3 states. [2019-09-10 08:39:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:49,920 INFO L93 Difference]: Finished difference Result 27358 states and 43475 transitions. [2019-09-10 08:39:49,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:49,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:39:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:49,980 INFO L225 Difference]: With dead ends: 27358 [2019-09-10 08:39:49,981 INFO L226 Difference]: Without dead ends: 27358 [2019-09-10 08:39:49,981 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 08:39:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27358 states. [2019-09-10 08:39:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27358 to 27356. [2019-09-10 08:39:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27356 states. [2019-09-10 08:39:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27356 states to 27356 states and 43474 transitions. [2019-09-10 08:39:50,329 INFO L78 Accepts]: Start accepts. Automaton has 27356 states and 43474 transitions. Word has length 76 [2019-09-10 08:39:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:50,330 INFO L475 AbstractCegarLoop]: Abstraction has 27356 states and 43474 transitions. [2019-09-10 08:39:50,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:39:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 27356 states and 43474 transitions. [2019-09-10 08:39:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:39:50,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:50,331 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:50,331 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 384202792, now seen corresponding path program 1 times [2019-09-10 08:39:50,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:50,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:50,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:50,466 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 08:39:50,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:50,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:50,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:50,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:50,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:50,467 INFO L87 Difference]: Start difference. First operand 27356 states and 43474 transitions. Second operand 5 states. [2019-09-10 08:39:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:50,684 INFO L93 Difference]: Finished difference Result 38723 states and 61355 transitions. [2019-09-10 08:39:50,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:39:50,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:39:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:50,943 INFO L225 Difference]: With dead ends: 38723 [2019-09-10 08:39:50,943 INFO L226 Difference]: Without dead ends: 38723 [2019-09-10 08:39:50,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38723 states. [2019-09-10 08:39:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38723 to 38717. [2019-09-10 08:39:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38717 states. [2019-09-10 08:39:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38717 states to 38717 states and 61352 transitions. [2019-09-10 08:39:51,438 INFO L78 Accepts]: Start accepts. Automaton has 38717 states and 61352 transitions. Word has length 77 [2019-09-10 08:39:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:51,439 INFO L475 AbstractCegarLoop]: Abstraction has 38717 states and 61352 transitions. [2019-09-10 08:39:51,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 38717 states and 61352 transitions. [2019-09-10 08:39:51,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:39:51,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:51,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:51,440 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1943011290, now seen corresponding path program 1 times [2019-09-10 08:39:51,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:51,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:51,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:51,678 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 08:39:51,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:51,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:51,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:51,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:51,679 INFO L87 Difference]: Start difference. First operand 38717 states and 61352 transitions. Second operand 5 states. [2019-09-10 08:39:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:52,547 INFO L93 Difference]: Finished difference Result 86203 states and 136530 transitions. [2019-09-10 08:39:52,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:39:52,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:39:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:52,686 INFO L225 Difference]: With dead ends: 86203 [2019-09-10 08:39:52,687 INFO L226 Difference]: Without dead ends: 86203 [2019-09-10 08:39:52,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86203 states. [2019-09-10 08:39:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86203 to 54113. [2019-09-10 08:39:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54113 states. [2019-09-10 08:39:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54113 states to 54113 states and 85430 transitions. [2019-09-10 08:39:53,819 INFO L78 Accepts]: Start accepts. Automaton has 54113 states and 85430 transitions. Word has length 80 [2019-09-10 08:39:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:53,820 INFO L475 AbstractCegarLoop]: Abstraction has 54113 states and 85430 transitions. [2019-09-10 08:39:53,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 54113 states and 85430 transitions. [2019-09-10 08:39:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:39:53,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:53,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:53,821 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 101898565, now seen corresponding path program 1 times [2019-09-10 08:39:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:53,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:53,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:53,916 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 08:39:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:39:53,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:53,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:39:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:39:53,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:39:53,918 INFO L87 Difference]: Start difference. First operand 54113 states and 85430 transitions. Second operand 5 states. [2019-09-10 08:39:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:54,250 INFO L93 Difference]: Finished difference Result 93619 states and 146421 transitions. [2019-09-10 08:39:54,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:39:54,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:39:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:54,398 INFO L225 Difference]: With dead ends: 93619 [2019-09-10 08:39:54,398 INFO L226 Difference]: Without dead ends: 93619 [2019-09-10 08:39:54,399 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 08:39:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93619 states. [2019-09-10 08:39:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93619 to 55321. [2019-09-10 08:39:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55321 states. [2019-09-10 08:39:56,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55321 states to 55321 states and 86629 transitions. [2019-09-10 08:39:56,516 INFO L78 Accepts]: Start accepts. Automaton has 55321 states and 86629 transitions. Word has length 81 [2019-09-10 08:39:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:39:56,516 INFO L475 AbstractCegarLoop]: Abstraction has 55321 states and 86629 transitions. [2019-09-10 08:39:56,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:39:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55321 states and 86629 transitions. [2019-09-10 08:39:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:39:56,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:39:56,519 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:39:56,519 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:39:56,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:39:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1367270456, now seen corresponding path program 1 times [2019-09-10 08:39:56,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:39:56,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:39:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:39:56,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:39:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:39:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:39:56,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:39:56,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:39:56,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:39:56,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:39:56,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:39:56,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:39:56,600 INFO L87 Difference]: Start difference. First operand 55321 states and 86629 transitions. Second operand 3 states. [2019-09-10 08:39:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:39:57,369 INFO L93 Difference]: Finished difference Result 95471 states and 149784 transitions. [2019-09-10 08:39:57,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:39:57,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:39:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:39:57,526 INFO L225 Difference]: With dead ends: 95471 [2019-09-10 08:39:57,527 INFO L226 Difference]: Without dead ends: 95471 [2019-09-10 08:39:57,528 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 08:39:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95471 states. [2019-09-10 08:40:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95471 to 95394. [2019-09-10 08:40:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95394 states. [2019-09-10 08:40:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95394 states to 95394 states and 149708 transitions. [2019-09-10 08:40:00,433 INFO L78 Accepts]: Start accepts. Automaton has 95394 states and 149708 transitions. Word has length 107 [2019-09-10 08:40:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:00,434 INFO L475 AbstractCegarLoop]: Abstraction has 95394 states and 149708 transitions. [2019-09-10 08:40:00,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:40:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 95394 states and 149708 transitions. [2019-09-10 08:40:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:40:00,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:00,438 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:00,438 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:00,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:00,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1245258729, now seen corresponding path program 1 times [2019-09-10 08:40:00,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:00,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:00,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:00,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:00,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:40:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:40:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:40:00,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:00,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:40:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:40:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:40:00,564 INFO L87 Difference]: Start difference. First operand 95394 states and 149708 transitions. Second operand 5 states. [2019-09-10 08:40:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:40:01,118 INFO L93 Difference]: Finished difference Result 110775 states and 173727 transitions. [2019-09-10 08:40:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:40:01,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-09-10 08:40:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:40:01,311 INFO L225 Difference]: With dead ends: 110775 [2019-09-10 08:40:01,311 INFO L226 Difference]: Without dead ends: 110775 [2019-09-10 08:40:01,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:40:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110775 states. [2019-09-10 08:40:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110775 to 110077. [2019-09-10 08:40:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110077 states. [2019-09-10 08:40:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110077 states to 110077 states and 172730 transitions. [2019-09-10 08:40:03,224 INFO L78 Accepts]: Start accepts. Automaton has 110077 states and 172730 transitions. Word has length 107 [2019-09-10 08:40:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:40:03,225 INFO L475 AbstractCegarLoop]: Abstraction has 110077 states and 172730 transitions. [2019-09-10 08:40:03,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:40:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 110077 states and 172730 transitions. [2019-09-10 08:40:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:40:03,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:40:03,228 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:40:03,228 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:40:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:03,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1113947205, now seen corresponding path program 1 times [2019-09-10 08:40:03,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:40:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:03,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:40:03,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:40:03,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:40:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:40:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:40:03,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:40:03,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:40:03,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 08:40:03,337 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [158], [191], [194], [199], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [295], [303], [307], [309], [311], [314], [345], [355], [365], [383], [386], [417], [427], [437], [455], [458], [489], [499], [509], [623], [624], [628], [629], [630] [2019-09-10 08:40:03,380 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:40:03,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:40:03,522 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:40:03,702 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:40:03,704 INFO L272 AbstractInterpreter]: Visited 91 different actions 159 times. Merged at 40 different actions 63 times. Never widened. Performed 650 root evaluator evaluations with a maximum evaluation depth of 5. Performed 650 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 171 variables. [2019-09-10 08:40:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:40:03,708 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:40:04,004 INFO L227 lantSequenceWeakener]: Weakened 87 states. On average, predicates are now at 87.24% of their original sizes. [2019-09-10 08:40:04,005 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:40:09,509 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 08:40:09,510 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:40:09,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:40:09,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [5] total 57 [2019-09-10 08:40:09,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:40:09,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 08:40:09,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 08:40:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:40:09,513 INFO L87 Difference]: Start difference. First operand 110077 states and 172730 transitions. Second operand 54 states. [2019-09-10 08:42:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:07,030 INFO L93 Difference]: Finished difference Result 1124359 states and 1704239 transitions. [2019-09-10 08:42:07,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 443 states. [2019-09-10 08:42:07,030 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2019-09-10 08:42:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:16,637 INFO L225 Difference]: With dead ends: 1124359 [2019-09-10 08:42:16,637 INFO L226 Difference]: Without dead ends: 1124359 [2019-09-10 08:42:16,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97943 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=23988, Invalid=191772, Unknown=0, NotChecked=0, Total=215760 [2019-09-10 08:42:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124359 states. [2019-09-10 08:42:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124359 to 282203. [2019-09-10 08:42:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282203 states. [2019-09-10 08:42:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282203 states to 282203 states and 439642 transitions. [2019-09-10 08:42:26,833 INFO L78 Accepts]: Start accepts. Automaton has 282203 states and 439642 transitions. Word has length 107 [2019-09-10 08:42:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:26,833 INFO L475 AbstractCegarLoop]: Abstraction has 282203 states and 439642 transitions. [2019-09-10 08:42:26,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 08:42:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 282203 states and 439642 transitions. [2019-09-10 08:42:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:42:26,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:26,838 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:26,838 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash 314392514, now seen corresponding path program 1 times [2019-09-10 08:42:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:26,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:26,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:26,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:26,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:26,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:26,921 INFO L87 Difference]: Start difference. First operand 282203 states and 439642 transitions. Second operand 3 states. [2019-09-10 08:42:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:33,395 INFO L93 Difference]: Finished difference Result 549283 states and 850448 transitions. [2019-09-10 08:42:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:33,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:42:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:34,315 INFO L225 Difference]: With dead ends: 549283 [2019-09-10 08:42:34,315 INFO L226 Difference]: Without dead ends: 549283 [2019-09-10 08:42:34,316 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 08:42:34,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549283 states. [2019-09-10 08:42:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549283 to 549281. [2019-09-10 08:42:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549281 states. [2019-09-10 08:42:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549281 states to 549281 states and 850447 transitions. [2019-09-10 08:42:41,880 INFO L78 Accepts]: Start accepts. Automaton has 549281 states and 850447 transitions. Word has length 108 [2019-09-10 08:42:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:42:41,880 INFO L475 AbstractCegarLoop]: Abstraction has 549281 states and 850447 transitions. [2019-09-10 08:42:41,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:42:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 549281 states and 850447 transitions. [2019-09-10 08:42:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:42:41,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:42:41,886 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:42:41,886 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:42:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:42:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1871113962, now seen corresponding path program 1 times [2019-09-10 08:42:41,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:42:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:41,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:42:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:42:41,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:42:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:42:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:42:49,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:42:49,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:42:49,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:42:49,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:42:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:42:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:49,571 INFO L87 Difference]: Start difference. First operand 549281 states and 850447 transitions. Second operand 3 states. [2019-09-10 08:42:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:42:50,840 INFO L93 Difference]: Finished difference Result 519929 states and 801148 transitions. [2019-09-10 08:42:50,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:42:50,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:42:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:42:51,730 INFO L225 Difference]: With dead ends: 519929 [2019-09-10 08:42:51,730 INFO L226 Difference]: Without dead ends: 519929 [2019-09-10 08:42:51,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:42:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519929 states. [2019-09-10 08:43:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519929 to 519927. [2019-09-10 08:43:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519927 states. [2019-09-10 08:43:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519927 states to 519927 states and 801147 transitions. [2019-09-10 08:43:08,954 INFO L78 Accepts]: Start accepts. Automaton has 519927 states and 801147 transitions. Word has length 108 [2019-09-10 08:43:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:08,955 INFO L475 AbstractCegarLoop]: Abstraction has 519927 states and 801147 transitions. [2019-09-10 08:43:08,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 519927 states and 801147 transitions. [2019-09-10 08:43:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:43:08,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:08,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:08,961 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash 907408615, now seen corresponding path program 1 times [2019-09-10 08:43:08,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:08,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:08,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:08,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:08,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:09,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:43:09,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:43:09,072 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 112 with the following transitions: [2019-09-10 08:43:09,072 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [148], [151], [154], [156], [158], [191], [194], [199], [214], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [293], [299], [303], [307], [309], [311], [314], [345], [355], [365], [383], [386], [417], [427], [437], [447], [451], [453], [455], [458], [489], [499], [509], [623], [624], [628], [629], [630] [2019-09-10 08:43:09,077 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:43:09,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:43:09,100 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:43:09,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:43:09,318 INFO L272 AbstractInterpreter]: Visited 100 different actions 380 times. Merged at 51 different actions 260 times. Widened at 21 different actions 28 times. Performed 1096 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1096 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 9 different actions. Largest state had 171 variables. [2019-09-10 08:43:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:09,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:43:09,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:43:09,320 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 08:43:09,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:09,354 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 08:43:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:09,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 08:43:09,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:43:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:43:10,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:43:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:43:10,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:43:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2019-09-10 08:43:10,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:10,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:10,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:43:10,873 INFO L87 Difference]: Start difference. First operand 519927 states and 801147 transitions. Second operand 4 states. [2019-09-10 08:43:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:12,568 INFO L93 Difference]: Finished difference Result 519929 states and 798172 transitions. [2019-09-10 08:43:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:12,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-10 08:43:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:13,406 INFO L225 Difference]: With dead ends: 519929 [2019-09-10 08:43:13,406 INFO L226 Difference]: Without dead ends: 519929 [2019-09-10 08:43:13,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:43:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519929 states. [2019-09-10 08:43:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519929 to 363789. [2019-09-10 08:43:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363789 states. [2019-09-10 08:43:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363789 states to 363789 states and 556857 transitions. [2019-09-10 08:43:26,426 INFO L78 Accepts]: Start accepts. Automaton has 363789 states and 556857 transitions. Word has length 111 [2019-09-10 08:43:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:26,426 INFO L475 AbstractCegarLoop]: Abstraction has 363789 states and 556857 transitions. [2019-09-10 08:43:26,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 363789 states and 556857 transitions. [2019-09-10 08:43:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:43:26,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:26,431 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:26,431 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1280820489, now seen corresponding path program 1 times [2019-09-10 08:43:26,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:26,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:26,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:26,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:26,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:26,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:26,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:26,505 INFO L87 Difference]: Start difference. First operand 363789 states and 556857 transitions. Second operand 3 states. [2019-09-10 08:43:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:29,633 INFO L93 Difference]: Finished difference Result 705869 states and 1070452 transitions. [2019-09-10 08:43:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:29,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:43:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:37,845 INFO L225 Difference]: With dead ends: 705869 [2019-09-10 08:43:37,846 INFO L226 Difference]: Without dead ends: 705869 [2019-09-10 08:43:37,847 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 08:43:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705869 states. [2019-09-10 08:43:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705869 to 705867. [2019-09-10 08:43:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705867 states. [2019-09-10 08:43:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705867 states to 705867 states and 1070451 transitions. [2019-09-10 08:43:47,058 INFO L78 Accepts]: Start accepts. Automaton has 705867 states and 1070451 transitions. Word has length 111 [2019-09-10 08:43:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:47,059 INFO L475 AbstractCegarLoop]: Abstraction has 705867 states and 1070451 transitions. [2019-09-10 08:43:47,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 705867 states and 1070451 transitions. [2019-09-10 08:43:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:43:47,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:47,064 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:47,064 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1525438544, now seen corresponding path program 1 times [2019-09-10 08:43:47,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:47,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:47,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:47,126 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 08:43:47,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:47,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:47,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:47,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:47,127 INFO L87 Difference]: Start difference. First operand 705867 states and 1070451 transitions. Second operand 3 states. [2019-09-10 08:43:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:57,941 INFO L93 Difference]: Finished difference Result 983773 states and 1491698 transitions. [2019-09-10 08:43:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:57,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 08:43:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:59,672 INFO L225 Difference]: With dead ends: 983773 [2019-09-10 08:43:59,672 INFO L226 Difference]: Without dead ends: 983773 [2019-09-10 08:43:59,673 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 08:44:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983773 states. [2019-09-10 08:44:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983773 to 942307. [2019-09-10 08:44:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942307 states. [2019-09-10 08:44:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942307 states to 942307 states and 1421033 transitions. [2019-09-10 08:44:36,097 INFO L78 Accepts]: Start accepts. Automaton has 942307 states and 1421033 transitions. Word has length 112 [2019-09-10 08:44:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:36,097 INFO L475 AbstractCegarLoop]: Abstraction has 942307 states and 1421033 transitions. [2019-09-10 08:44:36,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 942307 states and 1421033 transitions. [2019-09-10 08:44:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:44:36,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:36,103 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:36,103 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -553110832, now seen corresponding path program 1 times [2019-09-10 08:44:36,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:36,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:36,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:36,163 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 08:44:36,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:36,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:36,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:36,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:36,165 INFO L87 Difference]: Start difference. First operand 942307 states and 1421033 transitions. Second operand 3 states. [2019-09-10 08:44:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:54,525 INFO L93 Difference]: Finished difference Result 1335157 states and 2014188 transitions. [2019-09-10 08:44:54,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:54,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-10 08:44:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:56,638 INFO L225 Difference]: With dead ends: 1335157 [2019-09-10 08:44:56,638 INFO L226 Difference]: Without dead ends: 1335157 [2019-09-10 08:44:56,639 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 08:44:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335157 states. [2019-09-10 08:45:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335157 to 949111. [2019-09-10 08:45:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949111 states. [2019-09-10 08:45:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949111 states to 949111 states and 1431047 transitions. [2019-09-10 08:45:32,696 INFO L78 Accepts]: Start accepts. Automaton has 949111 states and 1431047 transitions. Word has length 112 [2019-09-10 08:45:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:32,696 INFO L475 AbstractCegarLoop]: Abstraction has 949111 states and 1431047 transitions. [2019-09-10 08:45:32,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 949111 states and 1431047 transitions. [2019-09-10 08:45:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:45:32,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:32,702 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:32,702 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash -920711507, now seen corresponding path program 1 times [2019-09-10 08:45:32,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:32,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:32,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:32,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:45:32,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:32,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:32,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:32,779 INFO L87 Difference]: Start difference. First operand 949111 states and 1431047 transitions. Second operand 3 states. [2019-09-10 08:45:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:45,902 INFO L93 Difference]: Finished difference Result 1075746 states and 1621327 transitions. [2019-09-10 08:45:45,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:45,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-10 08:45:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:47,800 INFO L225 Difference]: With dead ends: 1075746 [2019-09-10 08:45:47,800 INFO L226 Difference]: Without dead ends: 1075746 [2019-09-10 08:45:47,800 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 08:45:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075746 states. [2019-09-10 08:46:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075746 to 1071262. [2019-09-10 08:46:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071262 states. [2019-09-10 08:46:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071262 states to 1071262 states and 1616844 transitions. [2019-09-10 08:46:26,353 INFO L78 Accepts]: Start accepts. Automaton has 1071262 states and 1616844 transitions. Word has length 113 [2019-09-10 08:46:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:26,353 INFO L475 AbstractCegarLoop]: Abstraction has 1071262 states and 1616844 transitions. [2019-09-10 08:46:26,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1071262 states and 1616844 transitions. [2019-09-10 08:46:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:46:26,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:26,359 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:26,359 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:26,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1325926490, now seen corresponding path program 1 times [2019-09-10 08:46:26,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:26,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:26,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:46:26,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:46:26,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:46:26,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2019-09-10 08:46:26,487 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [148], [156], [158], [191], [194], [199], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [289], [303], [307], [309], [311], [314], [345], [355], [365], [383], [386], [417], [427], [437], [443], [447], [451], [453], [455], [458], [489], [499], [509], [623], [624], [628], [629], [630] [2019-09-10 08:46:26,491 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:46:26,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:46:26,514 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:46:26,626 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:46:26,626 INFO L272 AbstractInterpreter]: Visited 99 different actions 247 times. Merged at 48 different actions 136 times. Widened at 4 different actions 4 times. Performed 855 root evaluator evaluations with a maximum evaluation depth of 5. Performed 855 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 3 different actions. Largest state had 171 variables. [2019-09-10 08:46:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:26,627 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:46:29,063 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 86.61% of their original sizes. [2019-09-10 08:46:29,064 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:46:33,170 INFO L420 sIntCurrentIteration]: We unified 112 AI predicates to 112 [2019-09-10 08:46:33,170 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:46:33,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:46:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [61] imperfect sequences [8] total 67 [2019-09-10 08:46:33,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:33,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-10 08:46:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-10 08:46:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3252, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:46:33,173 INFO L87 Difference]: Start difference. First operand 1071262 states and 1616844 transitions. Second operand 61 states. [2019-09-10 08:49:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:50,973 INFO L93 Difference]: Finished difference Result 6384894 states and 9391875 transitions. [2019-09-10 08:49:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 681 states. [2019-09-10 08:49:50,973 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 113 [2019-09-10 08:49:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted.