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/psyco/psyco_abp_1-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 23:52:22,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 23:52:22,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 23:52:22,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 23:52:22,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 23:52:22,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 23:52:22,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 23:52:22,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 23:52:22,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 23:52:22,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 23:52:22,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 23:52:22,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 23:52:22,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 23:52:22,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 23:52:22,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 23:52:22,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 23:52:22,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 23:52:22,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 23:52:22,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 23:52:22,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 23:52:22,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 23:52:22,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 23:52:22,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 23:52:22,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 23:52:22,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 23:52:22,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 23:52:22,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 23:52:22,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 23:52:22,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 23:52:22,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 23:52:22,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 23:52:22,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 23:52:22,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 23:52:22,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 23:52:22,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 23:52:22,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 23:52:22,796 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 23:52:22,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 23:52:22,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 23:52:22,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 23:52:22,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 23:52:22,799 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-09 23:52:22,828 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 23:52:22,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 23:52:22,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 23:52:22,829 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 23:52:22,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 23:52:22,830 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 23:52:22,830 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 23:52:22,831 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 23:52:22,831 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 23:52:22,831 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 23:52:22,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 23:52:22,833 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 23:52:22,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 23:52:22,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 23:52:22,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 23:52:22,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 23:52:22,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 23:52:22,835 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 23:52:22,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 23:52:22,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 23:52:22,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 23:52:22,836 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 23:52:22,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 23:52:22,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 23:52:22,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 23:52:22,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 23:52:22,837 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 23:52:22,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 23:52:22,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 23:52:22,837 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 23:52:22,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 23:52:22,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 23:52:22,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 23:52:22,896 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 23:52:22,897 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 23:52:22,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-09-09 23:52:22,953 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15e0536f/1ae9658309b643a69cf8844fb71d2122/FLAGff58a7d88 [2019-09-09 23:52:23,441 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 23:52:23,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-3.c [2019-09-09 23:52:23,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15e0536f/1ae9658309b643a69cf8844fb71d2122/FLAGff58a7d88 [2019-09-09 23:52:23,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15e0536f/1ae9658309b643a69cf8844fb71d2122 [2019-09-09 23:52:23,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 23:52:23,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 23:52:23,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 23:52:23,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 23:52:23,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 23:52:23,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 11:52:23" (1/1) ... [2019-09-09 23:52:23,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d78cf53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:23, skipping insertion in model container [2019-09-09 23:52:23,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 11:52:23" (1/1) ... [2019-09-09 23:52:23,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 23:52:23,857 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 23:52:24,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 23:52:24,166 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 23:52:24,352 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 23:52:24,367 INFO L192 MainTranslator]: Completed translation [2019-09-09 23:52:24,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24 WrapperNode [2019-09-09 23:52:24,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 23:52:24,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 23:52:24,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 23:52:24,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 23:52:24,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (1/1) ... [2019-09-09 23:52:24,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 23:52:24,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 23:52:24,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 23:52:24,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 23:52:24,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (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-09 23:52:24,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 23:52:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 23:52:24,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 23:52:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 23:52:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 23:52:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 23:52:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 23:52:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 23:52:25,393 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 23:52:25,393 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 23:52:25,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 11:52:25 BoogieIcfgContainer [2019-09-09 23:52:25,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 23:52:25,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 23:52:25,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 23:52:25,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 23:52:25,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 11:52:23" (1/3) ... [2019-09-09 23:52:25,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7326b3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 11:52:25, skipping insertion in model container [2019-09-09 23:52:25,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 11:52:24" (2/3) ... [2019-09-09 23:52:25,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7326b3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 11:52:25, skipping insertion in model container [2019-09-09 23:52:25,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 11:52:25" (3/3) ... [2019-09-09 23:52:25,403 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-09-09 23:52:25,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 23:52:25,420 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 23:52:25,439 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 23:52:25,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 23:52:25,465 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 23:52:25,466 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 23:52:25,466 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 23:52:25,466 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 23:52:25,466 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 23:52:25,467 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 23:52:25,467 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 23:52:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-09-09 23:52:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-09 23:52:25,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:25,495 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:25,497 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:25,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1282888521, now seen corresponding path program 1 times [2019-09-09 23:52:25,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:25,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:25,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:25,631 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-09 23:52:25,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:25,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-09 23:52:25,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:25,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 23:52:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 23:52:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 23:52:25,660 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2019-09-09 23:52:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:25,688 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2019-09-09 23:52:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 23:52:25,690 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-09 23:52:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:25,702 INFO L225 Difference]: With dead ends: 114 [2019-09-09 23:52:25,703 INFO L226 Difference]: Without dead ends: 104 [2019-09-09 23:52:25,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 23:52:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-09 23:52:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-09 23:52:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-09 23:52:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-09-09 23:52:25,754 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 12 [2019-09-09 23:52:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:25,754 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-09-09 23:52:25,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 23:52:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-09-09 23:52:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-09 23:52:25,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:25,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:25,756 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1647326006, now seen corresponding path program 1 times [2019-09-09 23:52:25,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:25,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:25,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:25,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:25,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:25,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:25,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:25,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:25,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:25,829 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-09-09 23:52:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:25,903 INFO L93 Difference]: Finished difference Result 107 states and 172 transitions. [2019-09-09 23:52:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:25,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-09 23:52:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:25,905 INFO L225 Difference]: With dead ends: 107 [2019-09-09 23:52:25,905 INFO L226 Difference]: Without dead ends: 107 [2019-09-09 23:52:25,906 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-09 23:52:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-09 23:52:25,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-09-09 23:52:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-09 23:52:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2019-09-09 23:52:25,919 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 13 [2019-09-09 23:52:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:25,919 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2019-09-09 23:52:25,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2019-09-09 23:52:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 23:52:25,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:25,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:25,922 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -585097013, now seen corresponding path program 1 times [2019-09-09 23:52:25,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:25,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:25,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:25,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:26,260 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 15 [2019-09-09 23:52:26,696 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 38 [2019-09-09 23:52:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:26,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:26,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 23:52:26,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:26,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 23:52:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 23:52:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 23:52:26,706 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 4 states. [2019-09-09 23:52:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:27,091 INFO L93 Difference]: Finished difference Result 207 states and 319 transitions. [2019-09-09 23:52:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:27,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-09 23:52:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:27,094 INFO L225 Difference]: With dead ends: 207 [2019-09-09 23:52:27,094 INFO L226 Difference]: Without dead ends: 190 [2019-09-09 23:52:27,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 23:52:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-09 23:52:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2019-09-09 23:52:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-09 23:52:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2019-09-09 23:52:27,124 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 18 [2019-09-09 23:52:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:27,125 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2019-09-09 23:52:27,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 23:52:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2019-09-09 23:52:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 23:52:27,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:27,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:27,130 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1793109076, now seen corresponding path program 1 times [2019-09-09 23:52:27,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:27,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:27,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:27,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:27,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:27,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:27,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:27,175 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2019-09-09 23:52:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:27,208 INFO L93 Difference]: Finished difference Result 128 states and 199 transitions. [2019-09-09 23:52:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:27,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 23:52:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:27,211 INFO L225 Difference]: With dead ends: 128 [2019-09-09 23:52:27,211 INFO L226 Difference]: Without dead ends: 128 [2019-09-09 23:52:27,211 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-09 23:52:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-09 23:52:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-09-09 23:52:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-09 23:52:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2019-09-09 23:52:27,219 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 19 [2019-09-09 23:52:27,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:27,219 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2019-09-09 23:52:27,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:27,220 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2019-09-09 23:52:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 23:52:27,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:27,221 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:27,222 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1977269043, now seen corresponding path program 1 times [2019-09-09 23:52:27,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:27,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:27,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:52:27,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:27,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:27,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:27,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:27,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:27,265 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2019-09-09 23:52:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:27,294 INFO L93 Difference]: Finished difference Result 111 states and 168 transitions. [2019-09-09 23:52:27,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:27,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 23:52:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:27,296 INFO L225 Difference]: With dead ends: 111 [2019-09-09 23:52:27,296 INFO L226 Difference]: Without dead ends: 111 [2019-09-09 23:52:27,297 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-09 23:52:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-09 23:52:27,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2019-09-09 23:52:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-09 23:52:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2019-09-09 23:52:27,303 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 24 [2019-09-09 23:52:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:27,304 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2019-09-09 23:52:27,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2019-09-09 23:52:27,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 23:52:27,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:27,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:27,306 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 330981550, now seen corresponding path program 1 times [2019-09-09 23:52:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:27,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:27,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:27,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:29,418 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (div c_main_~P1~0 2)) (.cse21 (div c_main_~this_expect~0 2))) (let ((.cse17 (* (- 2) .cse21)) (.cse5 (* 2 .cse21)) (.cse19 (* (- 2) .cse20))) (let ((.cse12 (* 4294967296 (div (+ c_main_~P1~0 .cse19) 4294967296))) (.cse7 (* 4 .cse20)) (.cse15 (= .cse5 c_main_~this_expect~0)) (.cse16 (* 4294967296 (div c_main_~this_expect~0 4294967296))) (.cse14 (* 4294967296 (div (+ c_main_~this_expect~0 .cse17) 4294967296))) (.cse4 (* 2 c_main_~P1~0)) (.cse18 (= c_main_~P1~0 (* 2 .cse20)))) (let ((.cse6 (* 4294967296 (div (+ c_main_~P1~0 .cse19 (- 2)) 4294967296))) (.cse0 (< c_main_~P1~0 0)) (.cse10 (not .cse18)) (.cse8 (+ .cse14 .cse4 .cse5)) (.cse11 (or .cse18 (<= 0 c_main_~P1~0))) (.cse1 (< c_main_~this_expect~0 .cse16)) (.cse3 (* 4294967296 (div (+ c_main_~this_expect~0 .cse17 (- 2)) 4294967296))) (.cse2 (not .cse15)) (.cse13 (+ c_main_~this_expect~0 .cse12 .cse7)) (.cse9 (or .cse15 (<= .cse16 c_main_~this_expect~0)))) (or (and .cse0 (or (and .cse1 .cse2 (<= (+ .cse3 .cse4 .cse5 1) (+ c_main_~this_expect~0 .cse6 .cse7))) (and (<= .cse8 (+ c_main_~this_expect~0 .cse6 .cse7 3)) .cse9)) .cse10) (and (or (and .cse1 .cse2 (<= (+ c_main_~this_expect~0 .cse6 .cse7 1) (+ .cse3 .cse4 .cse5))) (and (<= (+ c_main_~this_expect~0 .cse6 .cse7 5) .cse8) .cse9)) .cse0 .cse10) (and .cse11 (or (and (<= (+ c_main_~this_expect~0 .cse12 .cse7 1) .cse8) .cse9) (and .cse1 .cse2 (<= .cse13 (+ .cse3 .cse4 .cse5 3))))) (and .cse11 (or (and .cse1 (<= (+ .cse3 .cse4 .cse5 5) .cse13) .cse2) (and (<= (+ .cse14 .cse4 .cse5 1) .cse13) .cse9)))))))) is different from false [2019-09-09 23:52:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-09 23:52:29,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:29,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:29,438 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-09 23:52:29,439 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [232], [235], [238], [519], [525], [526], [527], [528] [2019-09-09 23:52:29,477 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:29,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:29,632 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:31,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:31,558 INFO L272 AbstractInterpreter]: Visited 24 different actions 80 times. Merged at 16 different actions 49 times. Never widened. Performed 426 root evaluator evaluations with a maximum evaluation depth of 16. Performed 426 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 6 fixpoints after 3 different actions. Largest state had 39 variables. [2019-09-09 23:52:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:31,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:31,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:31,564 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-09 23:52:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:31,601 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-09 23:52:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:31,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-09 23:52:31,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:31,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:31,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:31,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-09-09 23:52:31,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:31,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 23:52:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 23:52:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2019-09-09 23:52:31,783 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 7 states. [2019-09-09 23:52:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:32,337 INFO L93 Difference]: Finished difference Result 352 states and 520 transitions. [2019-09-09 23:52:32,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 23:52:32,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-09 23:52:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:32,343 INFO L225 Difference]: With dead ends: 352 [2019-09-09 23:52:32,343 INFO L226 Difference]: Without dead ends: 314 [2019-09-09 23:52:32,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=37, Invalid=98, Unknown=1, NotChecked=20, Total=156 [2019-09-09 23:52:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-09 23:52:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2019-09-09 23:52:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-09-09 23:52:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 438 transitions. [2019-09-09 23:52:32,370 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 438 transitions. Word has length 26 [2019-09-09 23:52:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:32,370 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 438 transitions. [2019-09-09 23:52:32,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 23:52:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 438 transitions. [2019-09-09 23:52:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 23:52:32,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:32,372 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 23:52:32,372 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -353360053, now seen corresponding path program 1 times [2019-09-09 23:52:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:32,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:32,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:32,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:52:32,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:32,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:32,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:32,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:32,436 INFO L87 Difference]: Start difference. First operand 279 states and 438 transitions. Second operand 3 states. [2019-09-09 23:52:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:32,468 INFO L93 Difference]: Finished difference Result 301 states and 459 transitions. [2019-09-09 23:52:32,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:32,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 23:52:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:32,470 INFO L225 Difference]: With dead ends: 301 [2019-09-09 23:52:32,471 INFO L226 Difference]: Without dead ends: 301 [2019-09-09 23:52:32,471 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-09 23:52:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-09 23:52:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2019-09-09 23:52:32,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-09 23:52:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2019-09-09 23:52:32,482 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 28 [2019-09-09 23:52:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:32,484 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2019-09-09 23:52:32,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2019-09-09 23:52:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 23:52:32,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:32,486 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 23:52:32,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 893006896, now seen corresponding path program 1 times [2019-09-09 23:52:32,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:32,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:32,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:32,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:32,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:32,924 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 24 [2019-09-09 23:52:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:32,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:32,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:32,930 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2019-09-09 23:52:32,930 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [260], [275], [290], [293], [296], [299], [519], [525], [526], [527], [528] [2019-09-09 23:52:32,933 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:32,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:32,945 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:33,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:33,760 INFO L272 AbstractInterpreter]: Visited 28 different actions 74 times. Merged at 20 different actions 41 times. Never widened. Performed 373 root evaluator evaluations with a maximum evaluation depth of 16. Performed 373 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 3 different actions. Largest state had 43 variables. [2019-09-09 23:52:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:33,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:33,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:33,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:52:33,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:33,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:52:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:33,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-09 23:52:33,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-09 23:52:33,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:33,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:52:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-09 23:52:33,982 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 23:52:33,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-09-09 23:52:33,982 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:33,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 23:52:33,983 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand 3 states. [2019-09-09 23:52:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:33,995 INFO L93 Difference]: Finished difference Result 299 states and 454 transitions. [2019-09-09 23:52:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:33,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 23:52:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:33,998 INFO L225 Difference]: With dead ends: 299 [2019-09-09 23:52:33,999 INFO L226 Difference]: Without dead ends: 295 [2019-09-09 23:52:33,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 23:52:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-09 23:52:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-09-09 23:52:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-09 23:52:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 446 transitions. [2019-09-09 23:52:34,007 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 446 transitions. Word has length 30 [2019-09-09 23:52:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:34,007 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 446 transitions. [2019-09-09 23:52:34,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 446 transitions. [2019-09-09 23:52:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-09 23:52:34,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:34,009 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 23:52:34,009 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1859369291, now seen corresponding path program 1 times [2019-09-09 23:52:34,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-09 23:52:34,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:34,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:34,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:34,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:34,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:34,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:34,055 INFO L87 Difference]: Start difference. First operand 295 states and 446 transitions. Second operand 3 states. [2019-09-09 23:52:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:34,089 INFO L93 Difference]: Finished difference Result 247 states and 366 transitions. [2019-09-09 23:52:34,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:34,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-09 23:52:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:34,091 INFO L225 Difference]: With dead ends: 247 [2019-09-09 23:52:34,092 INFO L226 Difference]: Without dead ends: 247 [2019-09-09 23:52:34,092 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-09 23:52:34,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-09 23:52:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-09-09 23:52:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-09 23:52:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2019-09-09 23:52:34,098 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 36 [2019-09-09 23:52:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:34,099 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2019-09-09 23:52:34,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2019-09-09 23:52:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 23:52:34,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:34,100 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-09 23:52:34,101 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:34,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash -540657092, now seen corresponding path program 1 times [2019-09-09 23:52:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:34,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-09 23:52:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:34,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:34,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:34,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:34,142 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2019-09-09 23:52:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:34,174 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2019-09-09 23:52:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:34,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-09 23:52:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:34,177 INFO L225 Difference]: With dead ends: 229 [2019-09-09 23:52:34,177 INFO L226 Difference]: Without dead ends: 229 [2019-09-09 23:52:34,178 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-09 23:52:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-09 23:52:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-09 23:52:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-09 23:52:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2019-09-09 23:52:34,184 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 40 [2019-09-09 23:52:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:34,184 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2019-09-09 23:52:34,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2019-09-09 23:52:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 23:52:34,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:34,185 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-09-09 23:52:34,186 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash -850178048, now seen corresponding path program 1 times [2019-09-09 23:52:34,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:34,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-09 23:52:34,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 23:52:34,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 23:52:34,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 23:52:34,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 23:52:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 23:52:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 23:52:34,231 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2019-09-09 23:52:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:34,261 INFO L93 Difference]: Finished difference Result 147 states and 204 transitions. [2019-09-09 23:52:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 23:52:34,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-09 23:52:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:34,263 INFO L225 Difference]: With dead ends: 147 [2019-09-09 23:52:34,263 INFO L226 Difference]: Without dead ends: 147 [2019-09-09 23:52:34,264 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-09 23:52:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-09-09 23:52:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-09-09 23:52:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-09 23:52:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2019-09-09 23:52:34,268 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 49 [2019-09-09 23:52:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:34,269 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2019-09-09 23:52:34,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 23:52:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2019-09-09 23:52:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 23:52:34,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:34,270 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-09-09 23:52:34,271 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1539512454, now seen corresponding path program 1 times [2019-09-09 23:52:34,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:34,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:34,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-09 23:52:34,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:34,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:34,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2019-09-09 23:52:34,446 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [439], [442], [445], [519], [525], [526], [527], [528] [2019-09-09 23:52:34,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:34,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:34,460 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:52:47,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:52:47,302 INFO L272 AbstractInterpreter]: Visited 39 different actions 240 times. Merged at 31 different actions 172 times. Widened at 2 different actions 5 times. Performed 1302 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1302 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 27 fixpoints after 8 different actions. Largest state had 46 variables. [2019-09-09 23:52:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:47,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:52:47,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:47,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 23:52:47,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:47,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:52:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:47,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-09 23:52:47,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:52:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:47,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:52:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:47,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:52:47,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2019-09-09 23:52:47,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:52:47,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 23:52:47,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 23:52:47,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-09-09 23:52:47,604 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 10 states. [2019-09-09 23:52:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:52:47,740 INFO L93 Difference]: Finished difference Result 169 states and 230 transitions. [2019-09-09 23:52:47,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 23:52:47,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-09 23:52:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:52:47,742 INFO L225 Difference]: With dead ends: 169 [2019-09-09 23:52:47,743 INFO L226 Difference]: Without dead ends: 164 [2019-09-09 23:52:47,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-09-09 23:52:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-09 23:52:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-09-09 23:52:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-09 23:52:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 224 transitions. [2019-09-09 23:52:47,748 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 224 transitions. Word has length 50 [2019-09-09 23:52:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:52:47,749 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 224 transitions. [2019-09-09 23:52:47,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 23:52:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 224 transitions. [2019-09-09 23:52:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 23:52:47,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:52:47,750 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 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] [2019-09-09 23:52:47,751 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:52:47,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:52:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash -520384290, now seen corresponding path program 1 times [2019-09-09 23:52:47,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:52:47,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:47,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:52:47,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:52:47,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:52:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:52:50,306 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 123 DAG size of output: 31 [2019-09-09 23:52:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:52:50,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:52:50,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:52:50,327 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2019-09-09 23:52:50,328 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [47], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [525], [526], [527], [528] [2019-09-09 23:52:50,342 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:52:50,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:52:50,352 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:05,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:05,083 INFO L272 AbstractInterpreter]: Visited 44 different actions 318 times. Merged at 33 different actions 231 times. Widened at 4 different actions 9 times. Performed 1573 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1573 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 41 fixpoints after 10 different actions. Largest state had 50 variables. [2019-09-09 23:53:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:05,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:05,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:05,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:05,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:05,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-09 23:53:05,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:05,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:05,345 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:05,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,891 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 22 [2019-09-09 23:53:05,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 23:53:05,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:05,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17 [2019-09-09 23:53:05,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:05,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 23:53:05,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 23:53:05,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-09 23:53:05,960 INFO L87 Difference]: Start difference. First operand 162 states and 224 transitions. Second operand 11 states. [2019-09-09 23:53:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:06,305 INFO L93 Difference]: Finished difference Result 179 states and 248 transitions. [2019-09-09 23:53:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 23:53:06,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-09-09 23:53:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:06,307 INFO L225 Difference]: With dead ends: 179 [2019-09-09 23:53:06,307 INFO L226 Difference]: Without dead ends: 179 [2019-09-09 23:53:06,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-09-09 23:53:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-09 23:53:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-09-09 23:53:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-09 23:53:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 247 transitions. [2019-09-09 23:53:06,313 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 247 transitions. Word has length 60 [2019-09-09 23:53:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:06,313 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 247 transitions. [2019-09-09 23:53:06,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 23:53:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 247 transitions. [2019-09-09 23:53:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-09 23:53:06,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:06,314 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 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] [2019-09-09 23:53:06,315 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash -910800964, now seen corresponding path program 1 times [2019-09-09 23:53:06,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:06,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:06,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:06,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:06,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:06,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2019-09-09 23:53:06,753 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [253], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [525], [526], [527], [528] [2019-09-09 23:53:06,756 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:06,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:06,765 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:16,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:16,517 INFO L272 AbstractInterpreter]: Visited 44 different actions 461 times. Merged at 36 different actions 358 times. Widened at 5 different actions 15 times. Performed 2134 root evaluator evaluations with a maximum evaluation depth of 17. Performed 2134 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 59 fixpoints after 14 different actions. Largest state had 50 variables. [2019-09-09 23:53:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:16,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:16,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:16,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:16,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:16,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:16,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-09 23:53:16,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:16,647 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 23:53:16,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:16,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 13 [2019-09-09 23:53:16,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:16,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 23:53:16,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 23:53:16,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-09 23:53:16,792 INFO L87 Difference]: Start difference. First operand 178 states and 247 transitions. Second operand 9 states. [2019-09-09 23:53:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:16,909 INFO L93 Difference]: Finished difference Result 196 states and 272 transitions. [2019-09-09 23:53:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 23:53:16,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-09 23:53:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:16,911 INFO L225 Difference]: With dead ends: 196 [2019-09-09 23:53:16,911 INFO L226 Difference]: Without dead ends: 196 [2019-09-09 23:53:16,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-09 23:53:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-09 23:53:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-09-09 23:53:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-09-09 23:53:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 272 transitions. [2019-09-09 23:53:16,916 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 272 transitions. Word has length 69 [2019-09-09 23:53:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:16,917 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 272 transitions. [2019-09-09 23:53:16,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 23:53:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 272 transitions. [2019-09-09 23:53:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 23:53:16,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:16,918 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 3, 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] [2019-09-09 23:53:16,918 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1119936115, now seen corresponding path program 1 times [2019-09-09 23:53:16,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:16,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:16,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:17,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:17,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:17,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2019-09-09 23:53:17,282 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [379], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [507], [519], [525], [526], [527], [528] [2019-09-09 23:53:17,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:17,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:17,295 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:25,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:25,836 INFO L272 AbstractInterpreter]: Visited 44 different actions 299 times. Merged at 36 different actions 217 times. Widened at 4 different actions 7 times. Performed 1285 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1285 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 38 fixpoints after 12 different actions. Largest state had 50 variables. [2019-09-09 23:53:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:25,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:25,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:25,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:25,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:25,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-09 23:53:25,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:25,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:26,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:26,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:26,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-09 23:53:26,493 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 26 [2019-09-09 23:53:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 23:53:27,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:27,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2019-09-09 23:53:27,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:27,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 23:53:27,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 23:53:27,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-09-09 23:53:27,027 INFO L87 Difference]: Start difference. First operand 196 states and 272 transitions. Second operand 11 states. [2019-09-09 23:53:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:27,249 INFO L93 Difference]: Finished difference Result 215 states and 298 transitions. [2019-09-09 23:53:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 23:53:27,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-09-09 23:53:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:27,253 INFO L225 Difference]: With dead ends: 215 [2019-09-09 23:53:27,253 INFO L226 Difference]: Without dead ends: 215 [2019-09-09 23:53:27,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-09-09 23:53:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-09 23:53:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-09-09 23:53:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-09 23:53:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2019-09-09 23:53:27,264 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 81 [2019-09-09 23:53:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:27,264 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2019-09-09 23:53:27,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 23:53:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2019-09-09 23:53:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-09 23:53:27,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:27,270 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 23:53:27,270 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1236873263, now seen corresponding path program 1 times [2019-09-09 23:53:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:27,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:27,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:27,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 8 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:27,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:27,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:27,670 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 97 with the following transitions: [2019-09-09 23:53:27,670 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [14], [17], [20], [23], [28], [35], [38], [41], [44], [49], [131], [226], [229], [244], [247], [250], [255], [322], [325], [340], [355], [370], [373], [376], [381], [418], [421], [436], [451], [466], [481], [496], [499], [502], [505], [507], [519], [525], [526], [527], [528] [2019-09-09 23:53:27,672 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 23:53:27,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 23:53:27,680 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 23:53:35,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 23:53:35,252 INFO L272 AbstractInterpreter]: Visited 44 different actions 298 times. Merged at 36 different actions 217 times. Widened at 4 different actions 7 times. Performed 1284 root evaluator evaluations with a maximum evaluation depth of 17. Performed 1284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 17. Found 37 fixpoints after 11 different actions. Largest state had 50 variables. [2019-09-09 23:53:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:35,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 23:53:35,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:35,252 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:35,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:35,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 23:53:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:35,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-09 23:53:35,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:35,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 8 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:35,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 31 proven. 82 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-09 23:53:35,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:35,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 7] total 16 [2019-09-09 23:53:35,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:35,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 23:53:35,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 23:53:35,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-09 23:53:35,740 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand 11 states. [2019-09-09 23:53:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:36,001 INFO L93 Difference]: Finished difference Result 236 states and 327 transitions. [2019-09-09 23:53:36,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 23:53:36,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-09-09 23:53:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:36,003 INFO L225 Difference]: With dead ends: 236 [2019-09-09 23:53:36,003 INFO L226 Difference]: Without dead ends: 236 [2019-09-09 23:53:36,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-09 23:53:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-09 23:53:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-09-09 23:53:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-09 23:53:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2019-09-09 23:53:36,012 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 96 [2019-09-09 23:53:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:36,013 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2019-09-09 23:53:36,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 23:53:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2019-09-09 23:53:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 23:53:36,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 23:53:36,014 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 23:53:36,014 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 23:53:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 23:53:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2023343823, now seen corresponding path program 2 times [2019-09-09 23:53:36,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 23:53:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:36,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 23:53:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 23:53:36,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 23:53:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 23:53:36,802 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 24 [2019-09-09 23:53:37,074 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 23 [2019-09-09 23:53:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 9 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 23:53:37,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:37,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 23:53:37,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 23:53:37,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 23:53:37,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 23:53:37,106 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 23:53:37,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 23:53:37,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 23:53:37,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-09 23:53:37,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 23:53:37,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-09 23:53:37,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 23:53:37,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 112 proven. 25 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-09 23:53:37,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 23:53:37,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:37,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 23:53:37,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:37,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 23:53:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 26 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-09 23:53:38,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 23:53:38,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 25 [2019-09-09 23:53:38,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 23:53:38,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-09 23:53:38,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-09 23:53:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2019-09-09 23:53:38,111 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand 20 states. [2019-09-09 23:53:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 23:53:39,626 INFO L93 Difference]: Finished difference Result 270 states and 365 transitions. [2019-09-09 23:53:39,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-09 23:53:39,627 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 102 [2019-09-09 23:53:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 23:53:39,628 INFO L225 Difference]: With dead ends: 270 [2019-09-09 23:53:39,628 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 23:53:39,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2019-09-09 23:53:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 23:53:39,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 23:53:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 23:53:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 23:53:39,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2019-09-09 23:53:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 23:53:39,631 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 23:53:39,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-09 23:53:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 23:53:39,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 23:53:39,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 11:53:39 BoogieIcfgContainer [2019-09-09 23:53:39,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 23:53:39,640 INFO L168 Benchmark]: Toolchain (without parser) took 75849.03 ms. Allocated memory was 135.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 86.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 102.8 MB. Max. memory is 7.1 GB. [2019-09-09 23:53:39,641 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.3 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 23:53:39,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.77 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 86.1 MB in the beginning and 172.8 MB in the end (delta: -86.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-09-09 23:53:39,643 INFO L168 Benchmark]: Boogie Preprocessor took 80.16 ms. Allocated memory is still 200.8 MB. Free memory was 172.8 MB in the beginning and 168.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-09-09 23:53:39,643 INFO L168 Benchmark]: RCFGBuilder took 945.35 ms. Allocated memory is still 200.8 MB. Free memory was 168.7 MB in the beginning and 116.2 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-09-09 23:53:39,644 INFO L168 Benchmark]: TraceAbstraction took 74242.62 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 115.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2019-09-09 23:53:39,647 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 135.3 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 576.77 ms. Allocated memory was 135.3 MB in the beginning and 200.8 MB in the end (delta: 65.5 MB). Free memory was 86.1 MB in the beginning and 172.8 MB in the end (delta: -86.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.16 ms. Allocated memory is still 200.8 MB. Free memory was 172.8 MB in the beginning and 168.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 945.35 ms. Allocated memory is still 200.8 MB. Free memory was 168.7 MB in the beginning and 116.2 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74242.62 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 115.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 74.1s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2797 SDtfs, 2206 SDslu, 8521 SDs, 0 SdLazy, 1319 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1155 GetRequests, 1006 SyntacticMatches, 11 SemanticMatches, 138 ConstructedPredicates, 1 IntricatePredicates, 4 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 56.4s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 64 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1267 NumberOfCodeBlocks, 1231 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1748 ConstructedInterpolants, 205 QuantifiedInterpolants, 1735656 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3311 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 33 InterpolantComputations, 11 PerfectInterpolantSequences, 636/1854 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...