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/nla-digbench/hard.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:10:44,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:10:44,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:10:44,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:10:44,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:10:44,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:10:44,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:10:44,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:10:44,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:10:44,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:10:44,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:10:44,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:10:44,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:10:44,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:10:44,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:10:44,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:10:44,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:10:44,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:10:44,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:10:44,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:10:44,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:10:44,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:10:44,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:10:44,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:10:44,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:10:44,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:10:44,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:10:44,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:10:44,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:10:44,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:10:44,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:10:44,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:10:44,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:10:44,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:10:44,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:10:44,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:10:44,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:10:44,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:10:44,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:10:44,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:10:44,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:10:44,422 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-03 21:10:44,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:10:44,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:10:44,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:10:44,437 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:10:44,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:10:44,438 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:10:44,438 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:10:44,438 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:10:44,439 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:10:44,439 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:10:44,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:10:44,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:10:44,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:10:44,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:10:44,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:10:44,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:10:44,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:10:44,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:10:44,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:10:44,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:10:44,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:10:44,442 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:10:44,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:10:44,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:10:44,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:10:44,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:10:44,443 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:10:44,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:10:44,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:10:44,443 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:10:44,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:10:44,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:10:44,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:10:44,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:10:44,490 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:10:44,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard.c [2019-09-03 21:10:44,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59310a2a/dfb379be3b1b4e7693357225c1aecba3/FLAG7e0155fff [2019-09-03 21:10:44,987 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:10:44,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard.c [2019-09-03 21:10:44,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59310a2a/dfb379be3b1b4e7693357225c1aecba3/FLAG7e0155fff [2019-09-03 21:10:45,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59310a2a/dfb379be3b1b4e7693357225c1aecba3 [2019-09-03 21:10:45,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:10:45,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:10:45,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:10:45,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:10:45,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:10:45,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1514fdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45, skipping insertion in model container [2019-09-03 21:10:45,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,444 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:10:45,468 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:10:45,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:10:45,653 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:10:45,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:10:45,703 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:10:45,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45 WrapperNode [2019-09-03 21:10:45,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:10:45,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:10:45,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:10:45,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:10:45,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (1/1) ... [2019-09-03 21:10:45,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:10:45,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:10:45,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:10:45,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:10:45,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (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-03 21:10:45,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:10:45,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:10:45,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:10:45,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:10:45,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:10:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 21:10:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 21:10:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:10:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:10:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:10:45,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:10:46,081 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:10:46,081 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 21:10:46,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:10:46 BoogieIcfgContainer [2019-09-03 21:10:46,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:10:46,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:10:46,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:10:46,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:10:46,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:10:45" (1/3) ... [2019-09-03 21:10:46,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d9a443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:10:46, skipping insertion in model container [2019-09-03 21:10:46,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:10:45" (2/3) ... [2019-09-03 21:10:46,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d9a443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:10:46, skipping insertion in model container [2019-09-03 21:10:46,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:10:46" (3/3) ... [2019-09-03 21:10:46,089 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-09-03 21:10:46,097 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:10:46,104 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:10:46,120 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:10:46,146 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:10:46,147 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:10:46,147 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:10:46,147 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:10:46,147 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:10:46,147 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:10:46,147 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:10:46,148 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:10:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-03 21:10:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 21:10:46,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:46,173 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:46,175 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1301090018, now seen corresponding path program 1 times [2019-09-03 21:10:46,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:46,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:46,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:46,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:46,379 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-03 21:10:46,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:10:46,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 21:10:46,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:10:46,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:10:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:10:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 21:10:46,438 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-09-03 21:10:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:46,608 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2019-09-03 21:10:46,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:10:46,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 21:10:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:46,621 INFO L225 Difference]: With dead ends: 42 [2019-09-03 21:10:46,621 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 21:10:46,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:10:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 21:10:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-09-03 21:10:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 21:10:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-09-03 21:10:46,667 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2019-09-03 21:10:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:46,667 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-09-03 21:10:46,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:10:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-09-03 21:10:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 21:10:46,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:46,668 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:46,669 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1931384136, now seen corresponding path program 1 times [2019-09-03 21:10:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:46,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:46,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:10:46,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:10:46,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 21:10:46,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:10:46,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:10:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:10:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 21:10:46,755 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2019-09-03 21:10:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:46,833 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-03 21:10:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:10:46,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 21:10:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:46,837 INFO L225 Difference]: With dead ends: 38 [2019-09-03 21:10:46,837 INFO L226 Difference]: Without dead ends: 38 [2019-09-03 21:10:46,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:10:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-03 21:10:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-03 21:10:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 21:10:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-09-03 21:10:46,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 15 [2019-09-03 21:10:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:46,857 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-09-03 21:10:46,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:10:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-09-03 21:10:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 21:10:46,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:46,859 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:46,859 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2005010146, now seen corresponding path program 1 times [2019-09-03 21:10:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:46,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:46,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:46,886 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:46,887 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:46,887 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) [2019-09-03 21:10:46,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:46,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:46,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-03 21:10:46,922 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72] [2019-09-03 21:10:46,957 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:10:46,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:10:47,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:10:47,082 INFO L272 AbstractInterpreter]: Visited 16 different actions 26 times. Never merged. Never widened. Performed 31 root evaluator evaluations with a maximum evaluation depth of 6. Performed 31 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 8 variables. [2019-09-03 21:10:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:47,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:10:47,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:47,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:10:47,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:47,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:10:47,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 21:10:47,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 21:10:47,262 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:10:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:10:47,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:10:47,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:10:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:10:47,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:10:47,266 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2019-09-03 21:10:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:47,365 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-09-03 21:10:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:10:47,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-03 21:10:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:47,368 INFO L225 Difference]: With dead ends: 46 [2019-09-03 21:10:47,368 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 21:10:47,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:10:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 21:10:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 21:10:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 21:10:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-09-03 21:10:47,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 20 [2019-09-03 21:10:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:47,378 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-09-03 21:10:47,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:10:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-09-03 21:10:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 21:10:47,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:47,380 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:47,380 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:47,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1231057051, now seen corresponding path program 1 times [2019-09-03 21:10:47,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:47,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:47,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:47,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:47,390 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:47,390 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:47,390 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:47,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:47,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-03 21:10:47,420 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [32], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74] [2019-09-03 21:10:47,423 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:10:47,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:10:47,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:10:47,468 INFO L272 AbstractInterpreter]: Visited 20 different actions 35 times. Never merged. Never widened. Performed 39 root evaluator evaluations with a maximum evaluation depth of 7. Performed 39 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Never found a fixpoint. Largest state had 8 variables. [2019-09-03 21:10:47,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:47,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:10:47,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:47,469 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-03 21:10:47,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:10:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:47,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:10:47,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 21:10:47,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 21:10:47,623 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:10:47,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-03 21:10:47,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:10:47,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:10:47,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:10:47,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:10:47,625 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 5 states. [2019-09-03 21:10:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:47,699 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-09-03 21:10:47,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:10:47,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-03 21:10:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:47,701 INFO L225 Difference]: With dead ends: 56 [2019-09-03 21:10:47,701 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 21:10:47,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:10:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 21:10:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-03 21:10:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 21:10:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-03 21:10:47,710 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2019-09-03 21:10:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:47,710 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-03 21:10:47,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:10:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-03 21:10:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-03 21:10:47,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:47,712 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:47,712 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:47,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2079143466, now seen corresponding path program 1 times [2019-09-03 21:10:47,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:47,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:47,721 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:47,721 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:47,721 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:47,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:47,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2019-09-03 21:10:47,750 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [21], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73] [2019-09-03 21:10:47,752 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:10:47,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:10:47,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:10:47,917 INFO L272 AbstractInterpreter]: Visited 18 different actions 166 times. Merged at 5 different actions 30 times. Widened at 1 different actions 2 times. Performed 205 root evaluator evaluations with a maximum evaluation depth of 7. Performed 205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 21:10:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:47,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:10:47,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:47,923 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-03 21:10:47,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:47,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:10:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:47,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 21:10:47,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:10:48,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-03 21:10:48,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 21:10:48,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-03 21:10:48,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:10:48,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:10:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:10:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:10:48,142 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 5 states. [2019-09-03 21:10:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:48,242 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-09-03 21:10:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 21:10:48,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-09-03 21:10:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:48,251 INFO L225 Difference]: With dead ends: 60 [2019-09-03 21:10:48,251 INFO L226 Difference]: Without dead ends: 60 [2019-09-03 21:10:48,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-03 21:10:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-03 21:10:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-09-03 21:10:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-03 21:10:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-09-03 21:10:48,264 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 37 [2019-09-03 21:10:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:48,265 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-09-03 21:10:48,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:10:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-09-03 21:10:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-03 21:10:48,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:48,268 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 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-03 21:10:48,268 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1940610566, now seen corresponding path program 1 times [2019-09-03 21:10:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:48,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:48,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:48,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:48,290 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:48,290 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:48,290 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:48,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:48,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:48,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-03 21:10:48,337 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [21], [32], [39], [42], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77] [2019-09-03 21:10:48,340 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:10:48,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:10:48,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:10:48,534 INFO L272 AbstractInterpreter]: Visited 22 different actions 229 times. Merged at 7 different actions 42 times. Widened at 1 different actions 2 times. Performed 289 root evaluator evaluations with a maximum evaluation depth of 7. Performed 289 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 21:10:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:48,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:10:48,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:48,536 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) [2019-09-03 21:10:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:48,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:48,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:10:48,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 21:10:48,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:48,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:48,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Stream closed [2019-09-03 21:10:49,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:10:49,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-03 21:10:49,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:49,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 21:10:49,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 21:10:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-03 21:10:49,064 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 12 states. [2019-09-03 21:10:49,421 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-03 21:10:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:49,852 INFO L93 Difference]: Finished difference Result 124 states and 168 transitions. [2019-09-03 21:10:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:10:49,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-03 21:10:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:49,856 INFO L225 Difference]: With dead ends: 124 [2019-09-03 21:10:49,856 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 21:10:49,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-09-03 21:10:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 21:10:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2019-09-03 21:10:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 21:10:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2019-09-03 21:10:49,871 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 57 [2019-09-03 21:10:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:49,871 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2019-09-03 21:10:49,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 21:10:49,872 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2019-09-03 21:10:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 21:10:49,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:49,875 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 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-03 21:10:49,875 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2101027601, now seen corresponding path program 1 times [2019-09-03 21:10:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:49,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:49,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:49,883 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:49,884 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:49,884 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:10:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:49,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:49,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-03 21:10:49,932 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [21], [32], [37], [39], [42], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78] [2019-09-03 21:10:49,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:10:49,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:10:50,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:10:50,063 INFO L272 AbstractInterpreter]: Visited 22 different actions 229 times. Merged at 7 different actions 42 times. Widened at 1 different actions 2 times. Performed 276 root evaluator evaluations with a maximum evaluation depth of 7. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 21:10:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:50,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:10:50,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:50,064 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:10:50,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:50,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:50,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:10:50,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-03 21:10:50,186 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-09-03 21:10:50,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:10:50,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-03 21:10:50,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:50,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 21:10:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 21:10:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:10:50,319 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand 11 states. [2019-09-03 21:10:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:50,482 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2019-09-03 21:10:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 21:10:50,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-03 21:10:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:50,484 INFO L225 Difference]: With dead ends: 108 [2019-09-03 21:10:50,484 INFO L226 Difference]: Without dead ends: 108 [2019-09-03 21:10:50,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:10:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-03 21:10:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2019-09-03 21:10:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 21:10:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2019-09-03 21:10:50,509 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 68 [2019-09-03 21:10:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:50,510 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2019-09-03 21:10:50,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 21:10:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2019-09-03 21:10:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-03 21:10:50,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:50,512 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:50,512 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1178392653, now seen corresponding path program 2 times [2019-09-03 21:10:50,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:50,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:50,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:50,531 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:50,531 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:50,531 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:10:50,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:50,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:50,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:50,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:50,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:50,562 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:10:50,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:10:50,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:10:50,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:50,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 21:10:50,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 21:10:50,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 21:10:50,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:10:50,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 21:10:50,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:50,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:10:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:10:50,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 21:10:50,808 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand 5 states. [2019-09-03 21:10:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:50,849 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2019-09-03 21:10:50,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 21:10:50,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-03 21:10:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:50,851 INFO L225 Difference]: With dead ends: 105 [2019-09-03 21:10:50,851 INFO L226 Difference]: Without dead ends: 105 [2019-09-03 21:10:50,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 21:10:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-03 21:10:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-03 21:10:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 21:10:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2019-09-03 21:10:50,876 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 70 [2019-09-03 21:10:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:50,877 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2019-09-03 21:10:50,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:10:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2019-09-03 21:10:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-03 21:10:50,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:50,879 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 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] [2019-09-03 21:10:50,879 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2076897125, now seen corresponding path program 1 times [2019-09-03 21:10:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:50,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:50,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:50,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:50,886 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:50,887 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:50,887 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:50,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:50,917 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2019-09-03 21:10:50,918 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [19], [21], [32], [37], [39], [42], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80] [2019-09-03 21:10:50,921 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:10:50,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:10:50,985 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:10:50,985 INFO L272 AbstractInterpreter]: Visited 22 different actions 229 times. Merged at 7 different actions 42 times. Widened at 1 different actions 2 times. Performed 263 root evaluator evaluations with a maximum evaluation depth of 7. Performed 263 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2019-09-03 21:10:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:50,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:10:50,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:50,986 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 21:10:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:51,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:51,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 21:10:51,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-03 21:10:51,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:51,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-03 21:10:51,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:10:51,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-03 21:10:51,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:51,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-03 21:10:51,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-03 21:10:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-03 21:10:51,219 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand 13 states. [2019-09-03 21:10:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:51,411 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2019-09-03 21:10:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 21:10:51,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-03 21:10:51,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:51,413 INFO L225 Difference]: With dead ends: 109 [2019-09-03 21:10:51,413 INFO L226 Difference]: Without dead ends: 90 [2019-09-03 21:10:51,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-09-03 21:10:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-03 21:10:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-03 21:10:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-03 21:10:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-09-03 21:10:51,421 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 73 [2019-09-03 21:10:51,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:51,421 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-09-03 21:10:51,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-03 21:10:51,421 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-09-03 21:10:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-03 21:10:51,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:51,423 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:51,423 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:51,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411909, now seen corresponding path program 3 times [2019-09-03 21:10:51,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:51,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:51,431 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:51,431 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:51,431 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:51,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:51,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:51,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:51,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:51,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:51,479 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:51,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:10:51,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:10:51,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:10:51,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:51,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-03 21:10:51,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:51,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:51,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:00,921 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2019-09-03 21:11:05,720 WARN L188 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-03 21:11:18,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 38 proven. 102 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-09-03 21:11:18,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:11:22,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:22,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:22,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,376 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-03 21:11:29,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:29,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:34,923 WARN L188 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2019-09-03 21:11:40,513 WARN L188 SmtUtils]: Spent 773.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-03 21:11:44,478 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 39 [2019-09-03 21:11:44,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:01,136 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse15 (not (= |c___VERIFIER_assert_#in~cond| 1)))) (and (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse1 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse1 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse5 (* main_~B~0 main_~p~0))) (let ((.cse3 (* 4 .cse5))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse2 (div .cse3 2))) (+ (* (- 1) .cse2) (* (- 1) (div .cse2 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse4 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse4 2) .cse4)) main_~B~0)))) (not (<= .cse3 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse5))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse6 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse6 (div .cse6 2)))) (let ((.cse7 (div .cse1 2))) (+ (* (- 1) .cse7) (* (- 1) (div .cse7 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62)))))) (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse8 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse8 v_main_~r~0_BEFORE_CALL_68) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse12 (* main_~B~0 main_~p~0))) (let ((.cse10 (* 4 .cse12))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse9 (div .cse10 2))) (+ (* (- 1) .cse9) (* (- 1) (div .cse9 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse11 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse11 2) .cse11)) main_~B~0)))) (not (<= .cse10 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse12))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse13 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse13 (div .cse13 2)))) (let ((.cse14 (div .cse8 2))) (+ (* (- 1) .cse14) (* (- 1) (div .cse14 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62))))) .cse15) (or (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse23 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78))) (let ((.cse18 (* 4 .cse23))) (or (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse16 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse16 (div .cse16 2)))) (let ((.cse17 (div .cse18 2))) (+ (* (- 1) (div .cse17 2)) (* (- 1) .cse17) v_main_~r~0_BEFORE_CALL_68)))) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse22 (* main_~B~0 main_~p~0))) (let ((.cse20 (* 4 .cse22))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse19 (div .cse20 2))) (+ (* (- 1) .cse19) (* (- 1) (div .cse19 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse21 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse21 2) .cse21)) main_~B~0)))) (not (<= .cse20 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse22))))))) (<= .cse18 v_main_~r~0_BEFORE_CALL_68) (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse23)))))) .cse15))) is different from true [2019-09-03 21:12:05,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-09-03 21:12:12,241 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse1 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse1 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse5 (* main_~B~0 main_~p~0))) (let ((.cse3 (* 4 .cse5))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse2 (div .cse3 2))) (+ (* (- 1) .cse2) (* (- 1) (div .cse2 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse4 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse4 2) .cse4)) main_~B~0)))) (not (<= .cse3 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse5))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse6 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse6 (div .cse6 2)))) (let ((.cse7 (div .cse1 2))) (+ (* (- 1) .cse7) (* (- 1) (div .cse7 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62)))))) (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse10 (* 4 v_prenex_4))) (or (< v_prenex_6 (* 2 v_prenex_4)) (= (+ (* (let ((.cse8 (div (* 4 v_prenex_2) 2))) (+ .cse8 v_prenex_1 (div .cse8 2))) v_prenex_3) (let ((.cse9 (div .cse10 2))) (+ v_prenex_6 (* (- 1) (div .cse9 2)) (* (- 1) .cse9)))) v_prenex_5) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse14 (* v_prenex_8 v_prenex_7))) (let ((.cse11 (* 4 .cse14))) (and (not (<= .cse11 v_prenex_6)) (not (= v_prenex_5 (+ (* (let ((.cse12 (div (* 4 v_prenex_7) 2))) (+ .cse12 v_prenex_1 (div .cse12 2))) v_prenex_8) (let ((.cse13 (div .cse11 2))) (+ (* (- 1) (div .cse13 2)) v_prenex_6 (* (- 1) .cse13)))))) (not (< v_prenex_6 (* 2 .cse14))))))) (<= .cse10 v_prenex_6)))) (not (= |c___VERIFIER_assert_#in~cond| 1))))) is different from true [2019-09-03 21:12:16,255 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-09-03 21:12:20,610 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse8 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse3 (* 4 v_prenex_4))) (or (< v_prenex_6 (* 2 v_prenex_4)) (= (+ (* (let ((.cse1 (div (* 4 v_prenex_2) 2))) (+ .cse1 v_prenex_1 (div .cse1 2))) v_prenex_3) (let ((.cse2 (div .cse3 2))) (+ v_prenex_6 (* (- 1) (div .cse2 2)) (* (- 1) .cse2)))) v_prenex_5) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse7 (* v_prenex_8 v_prenex_7))) (let ((.cse4 (* 4 .cse7))) (and (not (<= .cse4 v_prenex_6)) (not (= v_prenex_5 (+ (* (let ((.cse5 (div (* 4 v_prenex_7) 2))) (+ .cse5 v_prenex_1 (div .cse5 2))) v_prenex_8) (let ((.cse6 (div .cse4 2))) (+ (* (- 1) (div .cse6 2)) v_prenex_6 (* (- 1) .cse6)))))) (not (< v_prenex_6 (* 2 .cse7))))))) (<= .cse3 v_prenex_6)))) (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse8) (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse9 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse9 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse13 (* main_~B~0 main_~p~0))) (let ((.cse11 (* 4 .cse13))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse10 (div .cse11 2))) (+ (* (- 1) .cse10) (* (- 1) (div .cse10 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse12 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse12 2) .cse12)) main_~B~0)))) (not (<= .cse11 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse13))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse14 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse14 (div .cse14 2)))) (let ((.cse15 (div .cse9 2))) (+ (* (- 1) .cse15) (* (- 1) (div .cse15 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62))))) .cse8))) is different from true [2019-09-03 21:12:20,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:20,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:20,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 27 proven. 82 refuted. 30 times theorem prover too weak. 216 trivial. 7 not checked. [2019-09-03 21:12:20,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:12:20,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2019-09-03 21:12:20,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:12:20,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-03 21:12:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-03 21:12:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=565, Unknown=22, NotChecked=156, Total=870 [2019-09-03 21:12:20,790 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 30 states. [2019-09-03 21:12:27,932 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c___VERIFIER_assert_#in~cond| 1))) (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse16 (not .cse8))) (and (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse1 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse1 v_main_~r~0_BEFORE_CALL_68) (= v_main_~d~0_BEFORE_CALL_62 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78)) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse5 (* main_~B~0 main_~p~0))) (let ((.cse3 (* 4 .cse5))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse2 (div .cse3 2))) (+ (* (- 1) .cse2) (* (- 1) (div .cse2 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse4 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse4 2) .cse4)) main_~B~0)))) (not (<= .cse3 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse5))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse6 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse6 (div .cse6 2)))) (let ((.cse7 (div .cse1 2))) (+ (* (- 1) .cse7) (* (- 1) (div .cse7 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62)))))) .cse8 (or .cse0 (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~d~0_BEFORE_CALL_62 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse9 (* 4 v_main_~d~0_BEFORE_CALL_62))) (or (<= .cse9 v_main_~r~0_BEFORE_CALL_68) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse13 (* main_~B~0 main_~p~0))) (let ((.cse11 (* 4 .cse13))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse10 (div .cse11 2))) (+ (* (- 1) .cse10) (* (- 1) (div .cse10 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse12 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse12 2) .cse12)) main_~B~0)))) (not (<= .cse11 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse13))))))) (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse14 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse14 (div .cse14 2)))) (let ((.cse15 (div .cse9 2))) (+ (* (- 1) .cse15) (* (- 1) (div .cse15 2)) v_main_~r~0_BEFORE_CALL_68)))) (< v_main_~r~0_BEFORE_CALL_68 (* 2 v_main_~d~0_BEFORE_CALL_62))))) .cse16) (or (forall ((v_main_~q~0_BEFORE_CALL_69 Int) (v_main_~p~0_BEFORE_CALL_78 Int) (v_main_~B~0_BEFORE_CALL_76 Int) (v_main_~A~0_BEFORE_CALL_68 Int) (v_main_~r~0_BEFORE_CALL_68 Int)) (let ((.cse24 (* v_main_~B~0_BEFORE_CALL_76 v_main_~p~0_BEFORE_CALL_78))) (let ((.cse19 (* 4 .cse24))) (or (= v_main_~A~0_BEFORE_CALL_68 (+ (* v_main_~B~0_BEFORE_CALL_76 (let ((.cse17 (div (* 4 v_main_~p~0_BEFORE_CALL_78) 2))) (+ v_main_~q~0_BEFORE_CALL_69 .cse17 (div .cse17 2)))) (let ((.cse18 (div .cse19 2))) (+ (* (- 1) (div .cse18 2)) (* (- 1) .cse18) v_main_~r~0_BEFORE_CALL_68)))) (exists ((main_~p~0 Int) (main_~B~0 Int)) (let ((.cse23 (* main_~B~0 main_~p~0))) (let ((.cse21 (* 4 .cse23))) (and (not (= v_main_~A~0_BEFORE_CALL_68 (+ (let ((.cse20 (div .cse21 2))) (+ (* (- 1) .cse20) (* (- 1) (div .cse20 2)) v_main_~r~0_BEFORE_CALL_68)) (* (let ((.cse22 (div (* 4 main_~p~0) 2))) (+ v_main_~q~0_BEFORE_CALL_69 (div .cse22 2) .cse22)) main_~B~0)))) (not (<= .cse21 v_main_~r~0_BEFORE_CALL_68)) (not (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse23))))))) (<= .cse19 v_main_~r~0_BEFORE_CALL_68) (< v_main_~r~0_BEFORE_CALL_68 (* 2 .cse24)))))) .cse16) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)))) is different from false [2019-09-03 21:12:48,153 WARN L188 SmtUtils]: Spent 16.06 s on a formula simplification. DAG size of input: 83 DAG size of output: 7 [2019-09-03 21:13:47,521 WARN L188 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-03 21:14:07,803 WARN L188 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-03 21:14:50,954 WARN L188 SmtUtils]: Spent 31.65 s on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-03 21:15:16,858 WARN L188 SmtUtils]: Spent 16.69 s on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-03 21:15:55,613 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-03 21:16:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:09,912 INFO L93 Difference]: Finished difference Result 117 states and 140 transitions. [2019-09-03 21:16:09,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 21:16:09,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2019-09-03 21:16:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:09,915 INFO L225 Difference]: With dead ends: 117 [2019-09-03 21:16:09,915 INFO L226 Difference]: Without dead ends: 117 [2019-09-03 21:16:09,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 145 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 182.7s TimeCoverageRelationStatistics Valid=230, Invalid=1149, Unknown=43, NotChecked=300, Total=1722 [2019-09-03 21:16:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-03 21:16:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2019-09-03 21:16:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-03 21:16:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2019-09-03 21:16:09,924 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 87 [2019-09-03 21:16:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:09,924 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2019-09-03 21:16:09,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-03 21:16:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2019-09-03 21:16:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-03 21:16:09,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:09,926 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:09,926 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash -16273295, now seen corresponding path program 4 times [2019-09-03 21:16:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:09,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:09,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:09,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:09,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:09,933 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:16:09,934 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:16:09,934 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:16:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:09,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:16:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:09,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:09,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:09,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:09,988 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:16:10,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:10,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:16:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:10,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 21:16:10,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-03 21:16:10,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:10,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,354 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-03 21:16:10,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:10,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:12,583 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-09-03 21:16:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:16:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:16:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-03 21:16:12,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:12,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 21:16:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 21:16:12,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-03 21:16:12,797 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 12 states. [2019-09-03 21:16:14,852 WARN L188 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-03 21:16:15,366 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-03 21:16:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:15,472 INFO L93 Difference]: Finished difference Result 146 states and 181 transitions. [2019-09-03 21:16:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 21:16:15,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-09-03 21:16:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:15,478 INFO L225 Difference]: With dead ends: 146 [2019-09-03 21:16:15,478 INFO L226 Difference]: Without dead ends: 146 [2019-09-03 21:16:15,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-09-03 21:16:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-03 21:16:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2019-09-03 21:16:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-03 21:16:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2019-09-03 21:16:15,486 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 92 [2019-09-03 21:16:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:15,487 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2019-09-03 21:16:15,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 21:16:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2019-09-03 21:16:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 21:16:15,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:15,500 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:15,500 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1784958798, now seen corresponding path program 2 times [2019-09-03 21:16:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:15,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:16:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:15,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:15,506 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:16:15,507 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:16:15,507 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:16:15,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:15,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:16:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:15,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:15,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:15,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:15,556 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:16:15,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:16:15,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:16:15,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:16:15,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:15,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-03 21:16:15,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-09-03 21:16:15,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:15,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:15,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:15,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:15,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:15,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-09-03 21:16:15,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:16:15,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-03 21:16:15,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:15,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 21:16:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 21:16:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-03 21:16:15,872 INFO L87 Difference]: Start difference. First operand 140 states and 172 transitions. Second operand 15 states. [2019-09-03 21:16:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:16:18,678 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2019-09-03 21:16:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-03 21:16:18,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-09-03 21:16:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:16:18,681 INFO L225 Difference]: With dead ends: 154 [2019-09-03 21:16:18,681 INFO L226 Difference]: Without dead ends: 137 [2019-09-03 21:16:18,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-03 21:16:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-03 21:16:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2019-09-03 21:16:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-09-03 21:16:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2019-09-03 21:16:18,694 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 98 [2019-09-03 21:16:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:16:18,695 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2019-09-03 21:16:18,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 21:16:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2019-09-03 21:16:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-03 21:16:18,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:16:18,696 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:16:18,697 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:16:18,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:16:18,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1767580262, now seen corresponding path program 5 times [2019-09-03 21:16:18,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:16:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:18,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:18,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:16:18,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:16:18,706 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:16:18,706 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:16:18,706 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:16:18,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:16:18,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:16:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:16:18,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:16:18,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:16:18,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:16:18,756 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:16:18,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:16:18,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:16:22,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-03 21:16:22,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:16:22,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-03 21:16:22,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:16:22,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 86 proven. 52 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-09-03 21:16:22,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:16:22,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:22,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:22,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:22,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,677 WARN L188 SmtUtils]: Spent 5.72 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-03 21:16:28,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:16:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:28,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms