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-0883e75 [2019-09-05 13:19:26,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:19:26,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:19:26,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:19:26,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:19:26,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:19:26,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:19:26,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:19:26,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:19:26,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:19:26,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:19:26,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:19:26,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:19:26,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:19:26,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:19:26,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:19:26,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:19:26,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:19:26,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:19:26,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:19:26,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:19:26,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:19:26,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:19:26,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:19:26,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:19:26,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:19:26,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:19:26,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:19:26,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:19:26,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:19:26,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:19:26,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:19:26,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:19:26,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:19:26,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:19:26,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:19:26,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:19:26,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:19:26,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:19:26,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:19:26,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:19:26,458 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-05 13:19:26,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:19:26,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:19:26,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:19:26,474 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:19:26,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:19:26,475 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:19:26,475 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:19:26,475 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:19:26,475 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:19:26,475 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:19:26,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:19:26,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:19:26,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:19:26,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:19:26,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:19:26,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:19:26,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:19:26,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:19:26,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:19:26,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:19:26,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:19:26,478 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:19:26,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:19:26,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:19:26,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:19:26,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:19:26,479 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:19:26,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:19:26,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:19:26,480 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:19:26,508 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:19:26,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:19:26,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:19:26,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:19:26,526 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:19:26,526 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-05 13:19:26,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398aa237c/4df3b5e6f4bf4f0983dd0d47340d3493/FLAG30426e9af [2019-09-05 13:19:27,007 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:19:27,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard.c [2019-09-05 13:19:27,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398aa237c/4df3b5e6f4bf4f0983dd0d47340d3493/FLAG30426e9af [2019-09-05 13:19:27,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398aa237c/4df3b5e6f4bf4f0983dd0d47340d3493 [2019-09-05 13:19:27,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:19:27,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:19:27,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:19:27,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:19:27,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:19:27,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe21a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27, skipping insertion in model container [2019-09-05 13:19:27,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,391 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:19:27,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:19:27,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:19:27,632 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:19:27,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:19:27,663 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:19:27,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27 WrapperNode [2019-09-05 13:19:27,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:19:27,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:19:27,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:19:27,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:19:27,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (1/1) ... [2019-09-05 13:19:27,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:19:27,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:19:27,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:19:27,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:19:27,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (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-05 13:19:27,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:19:27,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:19:27,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:19:27,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:19:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:19:27,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:19:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:19:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:19:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:19:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:19:27,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:19:28,071 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:19:28,071 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 13:19:28,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:19:28 BoogieIcfgContainer [2019-09-05 13:19:28,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:19:28,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:19:28,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:19:28,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:19:28,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:19:27" (1/3) ... [2019-09-05 13:19:28,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c79e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:19:28, skipping insertion in model container [2019-09-05 13:19:28,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:19:27" (2/3) ... [2019-09-05 13:19:28,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c79e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:19:28, skipping insertion in model container [2019-09-05 13:19:28,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:19:28" (3/3) ... [2019-09-05 13:19:28,100 INFO L109 eAbstractionObserver]: Analyzing ICFG hard.c [2019-09-05 13:19:28,123 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:19:28,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:19:28,165 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:19:28,189 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:19:28,189 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:19:28,189 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:19:28,189 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:19:28,190 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:19:28,190 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:19:28,190 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:19:28,190 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:19:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-05 13:19:28,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 13:19:28,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:28,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:19:28,215 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1301090018, now seen corresponding path program 1 times [2019-09-05 13:19:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:28,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:28,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:28,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:28,411 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-05 13:19:28,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:19:28,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:19:28,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:19:28,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:19:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:19:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:19:28,430 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-09-05 13:19:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:28,523 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2019-09-05 13:19:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:19:28,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-05 13:19:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:28,535 INFO L225 Difference]: With dead ends: 42 [2019-09-05 13:19:28,535 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 13:19:28,537 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-05 13:19:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 13:19:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-09-05 13:19:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 13:19:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-09-05 13:19:28,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2019-09-05 13:19:28,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:28,584 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-09-05 13:19:28,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:19:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-09-05 13:19:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 13:19:28,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:28,585 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:19:28,586 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1931384136, now seen corresponding path program 1 times [2019-09-05 13:19:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:28,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:28,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:28,651 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-05 13:19:28,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:19:28,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 13:19:28,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:19:28,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:19:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:19:28,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:19:28,657 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2019-09-05 13:19:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:28,744 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-05 13:19:28,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:19:28,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-05 13:19:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:28,747 INFO L225 Difference]: With dead ends: 38 [2019-09-05 13:19:28,747 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 13:19:28,748 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-05 13:19:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 13:19:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-05 13:19:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 13:19:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-09-05 13:19:28,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 15 [2019-09-05 13:19:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:28,764 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-09-05 13:19:28,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:19:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-09-05 13:19:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:19:28,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:28,766 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:19:28,767 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:28,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2005010146, now seen corresponding path program 1 times [2019-09-05 13:19:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:28,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:28,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:28,783 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:28,783 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:28,783 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:19:28,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:28,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:19:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:28,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-05 13:19:28,823 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72] [2019-09-05 13:19:28,863 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:19:28,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:19:28,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:19:28,990 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-05 13:19:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:28,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:19:28,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:28,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:29,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:19:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:29,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:19:29,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:29,107 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-05 13:19:29,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:29,157 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-05 13:19:29,160 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:19:29,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:19:29,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:19:29,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:19:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:19:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:19:29,162 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2019-09-05 13:19:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:29,250 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-09-05 13:19:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:19:29,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-05 13:19:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:29,252 INFO L225 Difference]: With dead ends: 46 [2019-09-05 13:19:29,252 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 13:19:29,253 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-05 13:19:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 13:19:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-05 13:19:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 13:19:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-09-05 13:19:29,262 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 20 [2019-09-05 13:19:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:29,262 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-09-05 13:19:29,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:19:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-09-05 13:19:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-05 13:19:29,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:29,264 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-05 13:19:29,265 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1231057051, now seen corresponding path program 1 times [2019-09-05 13:19:29,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:29,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:29,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:29,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:29,276 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:29,277 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:29,277 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-05 13:19:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:19:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:29,313 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-05 13:19:29,314 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-05 13:19:29,320 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:19:29,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:19:29,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:19:29,389 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-05 13:19:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:29,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:19:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:29,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:19:29,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:29,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:19:29,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:29,493 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-05 13:19:29,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:29,553 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-05 13:19:29,556 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:19:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-09-05 13:19:29,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:19:29,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:19:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:19:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:19:29,558 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 5 states. [2019-09-05 13:19:29,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:29,634 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2019-09-05 13:19:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:19:29,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-05 13:19:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:29,636 INFO L225 Difference]: With dead ends: 56 [2019-09-05 13:19:29,636 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 13:19:29,637 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-05 13:19:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 13:19:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-05 13:19:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-05 13:19:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-05 13:19:29,645 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2019-09-05 13:19:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:29,645 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-05 13:19:29,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:19:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-05 13:19:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-05 13:19:29,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:29,647 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-05 13:19:29,647 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2079143466, now seen corresponding path program 1 times [2019-09-05 13:19:29,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:29,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:29,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:29,659 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:29,660 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:29,660 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-05 13:19:29,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:19:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:29,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2019-09-05 13:19:29,694 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [21], [53], [56], [58], [61], [63], [64], [65], [66], [68], [69], [70], [71], [72], [73] [2019-09-05 13:19:29,696 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:19:29,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:19:29,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:19:29,960 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-05 13:19:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:29,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:19:29,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:29,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-05 13:19:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:29,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:19:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:29,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 13:19:29,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:30,057 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-05 13:19:30,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:30,126 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-05 13:19:30,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 13:19:30,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-05 13:19:30,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:19:30,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:19:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:19:30,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:19:30,132 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 5 states. [2019-09-05 13:19:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:30,223 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-09-05 13:19:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 13:19:30,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-09-05 13:19:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:30,231 INFO L225 Difference]: With dead ends: 60 [2019-09-05 13:19:30,231 INFO L226 Difference]: Without dead ends: 60 [2019-09-05 13:19:30,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:19:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-05 13:19:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-09-05 13:19:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 13:19:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2019-09-05 13:19:30,247 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 37 [2019-09-05 13:19:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:30,248 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-09-05 13:19:30,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:19:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2019-09-05 13:19:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-05 13:19:30,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:30,251 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-05 13:19:30,252 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1940610566, now seen corresponding path program 1 times [2019-09-05 13:19:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:30,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:30,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:30,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:30,277 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:30,279 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:30,279 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) [2019-09-05 13:19:30,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:30,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:19:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:30,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2019-09-05 13:19:30,332 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-05 13:19:30,335 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:19:30,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:19:30,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:19:30,494 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-05 13:19:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:30,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:19:30,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:30,495 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-05 13:19:30,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:30,524 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-05 13:19:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:30,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:19:30,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:30,693 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-05 13:19:30,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:30,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:30,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:30,960 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-05 13:19:30,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:19:30,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-05 13:19:30,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:19:30,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:19:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:19:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:19:30,971 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 12 states. [2019-09-05 13:19:31,324 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-05 13:19:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:31,820 INFO L93 Difference]: Finished difference Result 124 states and 168 transitions. [2019-09-05 13:19:31,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:19:31,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-05 13:19:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:31,826 INFO L225 Difference]: With dead ends: 124 [2019-09-05 13:19:31,826 INFO L226 Difference]: Without dead ends: 118 [2019-09-05 13:19:31,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-09-05 13:19:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-05 13:19:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2019-09-05 13:19:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-05 13:19:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2019-09-05 13:19:31,858 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 57 [2019-09-05 13:19:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:31,859 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2019-09-05 13:19:31,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:19:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2019-09-05 13:19:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-05 13:19:31,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:31,864 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-05 13:19:31,864 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2101027601, now seen corresponding path program 1 times [2019-09-05 13:19:31,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:31,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:31,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:31,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:31,889 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:31,889 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:31,890 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-05 13:19:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:31,905 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-05 13:19:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:31,928 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2019-09-05 13:19:31,928 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-05 13:19:31,934 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:19:31,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:19:32,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:19:32,071 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-05 13:19:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:32,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:19:32,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:32,071 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:32,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:32,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:19:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:32,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:19:32,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:32,192 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-05 13:19:32,192 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:32,307 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-05 13:19:32,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:19:32,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-05 13:19:32,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:19:32,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 13:19:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 13:19:32,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:19:32,315 INFO L87 Difference]: Start difference. First operand 96 states and 121 transitions. Second operand 11 states. [2019-09-05 13:19:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:32,484 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2019-09-05 13:19:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 13:19:32,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-05 13:19:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:32,486 INFO L225 Difference]: With dead ends: 108 [2019-09-05 13:19:32,486 INFO L226 Difference]: Without dead ends: 108 [2019-09-05 13:19:32,486 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-05 13:19:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-05 13:19:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2019-09-05 13:19:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-05 13:19:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2019-09-05 13:19:32,499 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 68 [2019-09-05 13:19:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:32,500 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2019-09-05 13:19:32,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 13:19:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2019-09-05 13:19:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-05 13:19:32,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:32,504 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-05 13:19:32,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1178392653, now seen corresponding path program 2 times [2019-09-05 13:19:32,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:32,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:32,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:32,520 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:32,520 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:32,520 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-05 13:19:32,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:19:32,540 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-05 13:19:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:32,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:19:32,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:19:32,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:32,559 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) [2019-09-05 13:19:32,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:19:32,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:32,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:19:32,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:19:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 13:19:32,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:32,742 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-05 13:19:32,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:32,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-05 13:19:32,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:19:32,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 13:19:32,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:19:32,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:19:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:19:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 13:19:32,808 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand 5 states. [2019-09-05 13:19:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:32,853 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2019-09-05 13:19:32,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 13:19:32,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-05 13:19:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:32,857 INFO L225 Difference]: With dead ends: 105 [2019-09-05 13:19:32,857 INFO L226 Difference]: Without dead ends: 105 [2019-09-05 13:19:32,857 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-05 13:19:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-05 13:19:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-09-05 13:19:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-05 13:19:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2019-09-05 13:19:32,868 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 70 [2019-09-05 13:19:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:32,869 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2019-09-05 13:19:32,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:19:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2019-09-05 13:19:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-05 13:19:32,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:32,871 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-05 13:19:32,871 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2076897125, now seen corresponding path program 1 times [2019-09-05 13:19:32,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:32,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:19:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:32,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:32,878 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:32,879 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:32,879 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) [2019-09-05 13:19:32,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:32,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:19:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:32,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2019-09-05 13:19:32,910 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-05 13:19:32,913 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:19:32,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:19:32,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:19:32,982 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-05 13:19:32,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:32,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:19:32,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:32,983 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:33,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:33,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:19:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:33,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 13:19:33,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:33,117 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-05 13:19:33,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:19:33,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,218 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-05 13:19:33,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:19:33,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-05 13:19:33,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:19:33,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 13:19:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 13:19:33,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-05 13:19:33,224 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand 13 states. [2019-09-05 13:19:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:19:33,416 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2019-09-05 13:19:33,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 13:19:33,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-05 13:19:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:19:33,418 INFO L225 Difference]: With dead ends: 109 [2019-09-05 13:19:33,418 INFO L226 Difference]: Without dead ends: 90 [2019-09-05 13:19:33,418 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-05 13:19:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-05 13:19:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-09-05 13:19:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-05 13:19:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-09-05 13:19:33,427 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 73 [2019-09-05 13:19:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:19:33,427 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-09-05 13:19:33,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 13:19:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-09-05 13:19:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-05 13:19:33,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:19:33,429 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-05 13:19:33,429 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:19:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:19:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1224411909, now seen corresponding path program 3 times [2019-09-05 13:19:33,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:19:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:33,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:19:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:19:33,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:19:33,437 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:19:33,437 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:19:33,438 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-05 13:19:33,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:19:33,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:19:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:19:33,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:19:33,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:19:33,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:19:33,481 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) [2019-09-05 13:19:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:19:33,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:19:33,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:19:33,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:19:33,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-05 13:19:33,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:19:33,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:33,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:43,103 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2019-09-05 13:19:45,424 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-05 13:19:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:19:58,135 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-05 13:19:58,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:20:01,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:01,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:01,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:08,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:15,473 WARN L188 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2019-09-05 13:20:21,538 WARN L188 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-05 13:20:22,220 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 39 [2019-09-05 13:20:22,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:25,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:20:37,189 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-05 13:20:41,631 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-09-05 13:20:48,583 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_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)))) .cse15) (or (forall ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse16 (* v_prenex_11 v_prenex_9))) (let ((.cse19 (* 4 .cse16))) (or (< v_prenex_13 (* 2 .cse16)) (= v_prenex_12 (+ (* v_prenex_11 (let ((.cse17 (div (* 4 v_prenex_9) 2))) (+ v_prenex_10 .cse17 (div .cse17 2)))) (let ((.cse18 (div .cse19 2))) (+ (* (- 1) .cse18) v_prenex_13 (* (- 1) (div .cse18 2)))))) (<= .cse19 v_prenex_13) (exists ((v_prenex_15 Int) (v_prenex_14 Int)) (let ((.cse23 (* v_prenex_15 v_prenex_14))) (let ((.cse22 (* 4 .cse23))) (and (not (= v_prenex_12 (+ (* (let ((.cse20 (div (* 4 v_prenex_14) 2))) (+ .cse20 (div .cse20 2) v_prenex_10)) v_prenex_15) (let ((.cse21 (div .cse22 2))) (+ (* (- 1) (div .cse21 2)) v_prenex_13 (* (- 1) .cse21)))))) (not (< v_prenex_13 (* 2 .cse23))) (not (<= .cse22 v_prenex_13)))))))))) .cse15))) is different from true [2019-09-05 13:20:51,244 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 90 [2019-09-05 13:22:02,299 WARN L188 SmtUtils]: Spent 28.67 s on a formula simplification. DAG size of input: 162 DAG size of output: 60 [2019-09-05 13:22:02,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:02,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:04,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:22:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 27 proven. 92 refuted. 23 times theorem prover too weak. 216 trivial. 4 not checked. [2019-09-05 13:22:04,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:22:04,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 30 [2019-09-05 13:22:04,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:22:04,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 13:22:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 13:22:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=593, Unknown=42, NotChecked=106, Total=870 [2019-09-05 13:22:04,554 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 30 states. [2019-09-05 13:22:10,774 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_prenex_6 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (let ((.cse11 (* 4 v_prenex_4))) (or (< v_prenex_6 (* 2 v_prenex_4)) (= (+ (* (let ((.cse9 (div (* 4 v_prenex_2) 2))) (+ .cse9 v_prenex_1 (div .cse9 2))) v_prenex_3) (let ((.cse10 (div .cse11 2))) (+ v_prenex_6 (* (- 1) (div .cse10 2)) (* (- 1) .cse10)))) v_prenex_5) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (let ((.cse15 (* v_prenex_8 v_prenex_7))) (let ((.cse12 (* 4 .cse15))) (and (not (<= .cse12 v_prenex_6)) (not (= v_prenex_5 (+ (* (let ((.cse13 (div (* 4 v_prenex_7) 2))) (+ .cse13 v_prenex_1 (div .cse13 2))) v_prenex_8) (let ((.cse14 (div .cse12 2))) (+ (* (- 1) (div .cse14 2)) v_prenex_6 (* (- 1) .cse14)))))) (not (< v_prenex_6 (* 2 .cse15))))))) (<= .cse11 v_prenex_6)))) .cse16) (or (forall ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (let ((.cse17 (* v_prenex_11 v_prenex_9))) (let ((.cse20 (* 4 .cse17))) (or (< v_prenex_13 (* 2 .cse17)) (= v_prenex_12 (+ (* v_prenex_11 (let ((.cse18 (div (* 4 v_prenex_9) 2))) (+ v_prenex_10 .cse18 (div .cse18 2)))) (let ((.cse19 (div .cse20 2))) (+ (* (- 1) .cse19) v_prenex_13 (* (- 1) (div .cse19 2)))))) (<= .cse20 v_prenex_13) (exists ((v_prenex_15 Int) (v_prenex_14 Int)) (let ((.cse24 (* v_prenex_15 v_prenex_14))) (let ((.cse23 (* 4 .cse24))) (and (not (= v_prenex_12 (+ (* (let ((.cse21 (div (* 4 v_prenex_14) 2))) (+ .cse21 (div .cse21 2) v_prenex_10)) v_prenex_15) (let ((.cse22 (div .cse23 2))) (+ (* (- 1) (div .cse22 2)) v_prenex_13 (* (- 1) .cse22)))))) (not (< v_prenex_13 (* 2 .cse24))) (not (<= .cse23 v_prenex_13)))))))))) .cse16) (= 1 c___VERIFIER_assert_~cond) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)))) is different from false [2019-09-05 13:22:12,806 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)))))) .cse0 (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-05 13:23:27,558 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 164 DAG size of output: 7 [2019-09-05 13:23:50,377 WARN L188 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-05 13:24:41,898 WARN L188 SmtUtils]: Spent 33.37 s on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-09-05 13:25:05,214 WARN L188 SmtUtils]: Spent 7.63 s on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-05 13:25:51,124 WARN L188 SmtUtils]: Spent 998.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-09-05 13:26:06,677 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-05 13:26:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:35,399 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2019-09-05 13:26:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 13:26:35,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2019-09-05 13:26:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:35,401 INFO L225 Difference]: With dead ends: 107 [2019-09-05 13:26:35,401 INFO L226 Difference]: Without dead ends: 107 [2019-09-05 13:26:35,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 235.9s TimeCoverageRelationStatistics Valid=229, Invalid=1124, Unknown=69, NotChecked=300, Total=1722 [2019-09-05 13:26:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-05 13:26:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2019-09-05 13:26:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-05 13:26:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-09-05 13:26:35,411 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 87 [2019-09-05 13:26:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:35,411 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-09-05 13:26:35,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 13:26:35,411 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-09-05 13:26:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-05 13:26:35,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:35,413 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-05 13:26:35,413 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:35,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash -16273295, now seen corresponding path program 4 times [2019-09-05 13:26:35,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:35,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:35,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:35,421 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:26:35,421 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:26:35,421 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) [2019-09-05 13:26:35,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:35,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:26:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:35,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:35,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:35,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:35,488 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) [2019-09-05 13:26:35,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:35,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:26:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:35,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 13:26:35,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:35,631 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-05 13:26:35,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,179 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-05 13:26:36,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:36,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:37,357 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 119 DAG size of output: 105 [2019-09-05 13:26:37,585 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-05 13:26:37,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:26:37,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-05 13:26:37,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:37,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-05 13:26:37,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-05 13:26:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-05 13:26:37,600 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 12 states. [2019-09-05 13:26:39,908 WARN L188 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-05 13:26:40,792 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-05 13:26:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:40,942 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2019-09-05 13:26:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 13:26:40,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2019-09-05 13:26:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:40,945 INFO L225 Difference]: With dead ends: 138 [2019-09-05 13:26:40,945 INFO L226 Difference]: Without dead ends: 138 [2019-09-05 13:26:40,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 169 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:26:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-05 13:26:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2019-09-05 13:26:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-05 13:26:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2019-09-05 13:26:40,954 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 92 [2019-09-05 13:26:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:40,954 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2019-09-05 13:26:40,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-05 13:26:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2019-09-05 13:26:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-05 13:26:40,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:40,956 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-05 13:26:40,956 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:40,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1784958798, now seen corresponding path program 2 times [2019-09-05 13:26:40,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:40,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:40,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:26:40,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:40,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:40,963 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:26:40,964 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:26:40,964 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:26:40,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:40,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:26:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:41,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:41,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:41,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:41,023 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-05 13:26:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:26:41,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:26:41,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:26:41,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:26:41,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 13:26:41,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:41,151 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-05 13:26:41,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:41,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:41,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:41,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:26:41,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:26:41,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-05 13:26:41,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:26:41,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 13:26:41,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 13:26:41,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-09-05 13:26:41,326 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 15 states. [2019-09-05 13:26:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:26:47,215 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2019-09-05 13:26:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 13:26:47,216 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-09-05 13:26:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:26:47,217 INFO L225 Difference]: With dead ends: 146 [2019-09-05 13:26:47,218 INFO L226 Difference]: Without dead ends: 129 [2019-09-05 13:26:47,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-05 13:26:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-05 13:26:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2019-09-05 13:26:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-05 13:26:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-09-05 13:26:47,225 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 98 [2019-09-05 13:26:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:26:47,226 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-09-05 13:26:47,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 13:26:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-09-05 13:26:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-05 13:26:47,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:26:47,228 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-05 13:26:47,228 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:26:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:26:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1767580262, now seen corresponding path program 5 times [2019-09-05 13:26:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:26:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:47,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:26:47,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:26:47,235 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:26:47,235 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:26:47,235 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) [2019-09-05 13:26:47,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:26:47,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:26:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:26:47,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:26:47,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:26:47,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:26:47,285 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-05 13:26:47,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:26:47,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:26:50,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-05 13:26:50,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:26:50,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-05 13:26:50,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:26:51,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:51,170 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-05 13:26:51,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:26:51,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:51,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:51,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:51,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,920 WARN L188 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-05 13:26:54,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:54,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:55,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 13:26:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:26:55,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms