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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/tcpy.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:14:25,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:14:25,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:14:25,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:14:25,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:14:25,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:14:25,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:14:25,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:14:25,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:14:25,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:14:25,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:14:25,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:14:25,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:14:25,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:14:25,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:14:25,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:14:25,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:14:25,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:14:25,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:14:25,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:14:25,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:14:25,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:14:25,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:14:25,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:14:25,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:14:25,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:14:25,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:14:25,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:14:25,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:14:25,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:14:25,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:14:25,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:14:25,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:14:25,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:14:25,441 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:14:25,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:14:25,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:14:25,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:14:25,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:14:25,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:14:25,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:14:25,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:14:25,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:14:25,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:14:25,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:14:25,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:14:25,486 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:14:25,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:14:25,486 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:14:25,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:14:25,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:14:25,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:14:25,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:14:25,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:14:25,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:14:25,492 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:14:25,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:14:25,492 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:14:25,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:14:25,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:14:25,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:14:25,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:14:25,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:14:25,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:14:25,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:14:25,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:14:25,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:14:25,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:14:25,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:14:25,496 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:14:25,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:14:25,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:14:25,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:14:25,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:14:25,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:14:25,567 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:14:25,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/tcpy.c [2019-09-16 16:14:25,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48d51869/31cb60ccc41c4be286fdea5412fd0354/FLAG9d6121128 [2019-09-16 16:14:25,984 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:14:25,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/tcpy.c [2019-09-16 16:14:25,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48d51869/31cb60ccc41c4be286fdea5412fd0354/FLAG9d6121128 [2019-09-16 16:14:26,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48d51869/31cb60ccc41c4be286fdea5412fd0354 [2019-09-16 16:14:26,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:14:26,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:14:26,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:14:26,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:14:26,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:14:26,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1824251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26, skipping insertion in model container [2019-09-16 16:14:26,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,384 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:14:26,400 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:14:26,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:14:26,618 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:14:26,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:14:26,659 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:14:26,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26 WrapperNode [2019-09-16 16:14:26,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:14:26,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:14:26,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:14:26,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:14:26,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (1/1) ... [2019-09-16 16:14:26,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:14:26,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:14:26,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:14:26,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:14:26,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (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-16 16:14:26,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:14:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:14:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-16 16:14:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:14:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:14:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 16:14:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 16:14:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:14:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:14:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:14:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:14:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:14:26,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:14:26,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:14:26,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:14:26,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:14:27,083 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:14:27,083 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-16 16:14:27,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:14:27 BoogieIcfgContainer [2019-09-16 16:14:27,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:14:27,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:14:27,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:14:27,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:14:27,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:14:26" (1/3) ... [2019-09-16 16:14:27,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a91ee44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:14:27, skipping insertion in model container [2019-09-16 16:14:27,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:14:26" (2/3) ... [2019-09-16 16:14:27,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a91ee44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:14:27, skipping insertion in model container [2019-09-16 16:14:27,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:14:27" (3/3) ... [2019-09-16 16:14:27,092 INFO L109 eAbstractionObserver]: Analyzing ICFG tcpy.c [2019-09-16 16:14:27,109 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:14:27,123 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:14:27,167 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:14:27,198 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:14:27,199 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:14:27,199 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:14:27,199 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:14:27,199 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:14:27,199 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:14:27,200 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:14:27,200 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:14:27,200 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:14:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-16 16:14:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:14:27,225 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:27,226 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:27,228 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:27,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash 941892528, now seen corresponding path program 1 times [2019-09-16 16:14:27,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:27,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:27,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:27,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:27,366 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-16 16:14:27,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:14:27,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:14:27,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:14:27,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:14:27,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:14:27,387 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-16 16:14:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:27,406 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2019-09-16 16:14:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:14:27,408 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-16 16:14:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:27,415 INFO L225 Difference]: With dead ends: 47 [2019-09-16 16:14:27,416 INFO L226 Difference]: Without dead ends: 23 [2019-09-16 16:14:27,418 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:14:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-16 16:14:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-16 16:14:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-16 16:14:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-09-16 16:14:27,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 16 [2019-09-16 16:14:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:27,454 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-09-16 16:14:27,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:14:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-09-16 16:14:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 16:14:27,456 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:27,456 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:27,456 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2128337372, now seen corresponding path program 1 times [2019-09-16 16:14:27,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:27,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:27,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:27,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:27,551 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-16 16:14:27,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:14:27,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:14:27,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:14:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:14:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:14:27,556 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-09-16 16:14:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:27,620 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-09-16 16:14:27,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:14:27,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-16 16:14:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:27,622 INFO L225 Difference]: With dead ends: 39 [2019-09-16 16:14:27,622 INFO L226 Difference]: Without dead ends: 25 [2019-09-16 16:14:27,623 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:14:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-16 16:14:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-16 16:14:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-16 16:14:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-16 16:14:27,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2019-09-16 16:14:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:27,630 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-16 16:14:27,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:14:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-16 16:14:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 16:14:27,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:27,632 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:27,632 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 823833890, now seen corresponding path program 1 times [2019-09-16 16:14:27,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:27,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:27,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:14:27,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:14:27,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:14:27,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:14:27,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:14:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:14:27,719 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2019-09-16 16:14:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:27,799 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-09-16 16:14:27,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:14:27,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-16 16:14:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:27,804 INFO L225 Difference]: With dead ends: 42 [2019-09-16 16:14:27,804 INFO L226 Difference]: Without dead ends: 31 [2019-09-16 16:14:27,805 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:14:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-16 16:14:27,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-16 16:14:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-16 16:14:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-16 16:14:27,832 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-09-16 16:14:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:27,832 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-16 16:14:27,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:14:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-16 16:14:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 16:14:27,836 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:27,836 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:27,836 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:27,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1371679936, now seen corresponding path program 1 times [2019-09-16 16:14:27,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:27,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:27,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:14:27,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:27,950 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:27,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:28,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:14:28,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:14:28,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-16 16:14:28,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:14:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:14:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:14:28,080 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 6 states. [2019-09-16 16:14:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:28,167 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-16 16:14:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:14:28,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-16 16:14:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:28,169 INFO L225 Difference]: With dead ends: 43 [2019-09-16 16:14:28,169 INFO L226 Difference]: Without dead ends: 28 [2019-09-16 16:14:28,171 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:14:28,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-16 16:14:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-16 16:14:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-16 16:14:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-16 16:14:28,183 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-09-16 16:14:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:28,184 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-16 16:14:28,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:14:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-16 16:14:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 16:14:28,185 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:28,186 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:28,187 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash -172159810, now seen corresponding path program 2 times [2019-09-16 16:14:28,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:28,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:28,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:28,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:28,977 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 16:14:28,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:29,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:14:29,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:29,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-16 16:14:29,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:29,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:14:29,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:29,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:29,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:29,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-16 16:14:29,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:29,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:29,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:29,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2019-09-16 16:14:29,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:29,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:29,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:14:29,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2019-09-16 16:14:29,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:29,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-16 16:14:29,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:29,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:29,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:29,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-16 16:14:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:14:29,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:29,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2019-09-16 16:14:29,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-16 16:14:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-16 16:14:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-09-16 16:14:29,440 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 20 states. [2019-09-16 16:14:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:30,660 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2019-09-16 16:14:30,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-16 16:14:30,663 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2019-09-16 16:14:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:30,664 INFO L225 Difference]: With dead ends: 76 [2019-09-16 16:14:30,665 INFO L226 Difference]: Without dead ends: 74 [2019-09-16 16:14:30,666 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=264, Invalid=926, Unknown=0, NotChecked=0, Total=1190 [2019-09-16 16:14:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-16 16:14:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 33. [2019-09-16 16:14:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-16 16:14:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-16 16:14:30,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2019-09-16 16:14:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:30,676 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-16 16:14:30,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-16 16:14:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-16 16:14:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:14:30,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:30,677 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:30,677 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash 606859858, now seen corresponding path program 1 times [2019-09-16 16:14:30,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:30,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:30,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:14:31,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:31,545 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:31,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:31,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-16 16:14:31,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:31,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:14:31,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:31,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:31,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:31,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-16 16:14:31,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-16 16:14:31,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:31,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:31,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:31,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-16 16:14:31,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:31,799 INFO L341 Elim1Store]: treesize reduction 31, result has 45.6 percent of original size [2019-09-16 16:14:31,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 52 [2019-09-16 16:14:31,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:31,822 INFO L567 ElimStorePlain]: treesize reduction 26, result has 62.3 percent of original size [2019-09-16 16:14:31,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:14:31,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:43 [2019-09-16 16:14:33,939 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~acopy~0.offset_BEFORE_CALL_1 Int) (v_main_~acopy~0.base_BEFORE_CALL_1 Int) (~SIZE~0 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_1))) (and (= (select .cse0 v_main_~acopy~0.offset_BEFORE_CALL_1) (select .cse1 v_main_~a~0.offset_BEFORE_CALL_1)) (not (= v_main_~a~0.base_BEFORE_CALL_1 v_main_~acopy~0.base_BEFORE_CALL_1)) (< 1 ~SIZE~0) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ .cse2 v_main_~a~0.offset_BEFORE_CALL_1 (- 4))) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_1 .cse2 (- 4))))) (<= ~SIZE~0 2)))) is different from true [2019-09-16 16:14:34,120 INFO L341 Elim1Store]: treesize reduction 20, result has 74.0 percent of original size [2019-09-16 16:14:34,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 69 [2019-09-16 16:14:34,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:14:34,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-09-16 16:14:34,154 INFO L567 ElimStorePlain]: treesize reduction 23, result has 37.8 percent of original size [2019-09-16 16:14:34,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:34,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:3 [2019-09-16 16:14:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-16 16:14:34,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:34,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-09-16 16:14:34,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-16 16:14:34,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-16 16:14:34,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2019-09-16 16:14:34,227 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 25 states. [2019-09-16 16:14:38,843 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-16 16:14:40,896 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2019-09-16 16:14:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:45,275 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-09-16 16:14:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-16 16:14:45,275 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-09-16 16:14:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:45,278 INFO L225 Difference]: With dead ends: 81 [2019-09-16 16:14:45,278 INFO L226 Difference]: Without dead ends: 62 [2019-09-16 16:14:45,279 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=4, NotChecked=72, Total=1482 [2019-09-16 16:14:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-09-16 16:14:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2019-09-16 16:14:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-16 16:14:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-09-16 16:14:45,289 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 30 [2019-09-16 16:14:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:45,290 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-09-16 16:14:45,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-16 16:14:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-09-16 16:14:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:14:45,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:45,291 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:45,291 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1975161648, now seen corresponding path program 2 times [2019-09-16 16:14:45,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:45,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:45,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:14:45,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:14:45,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:45,522 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:45,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:14:45,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:14:45,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:45,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 16:14:45,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:14:45,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:45,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-09-16 16:14:45,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 16:14:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 16:14:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:14:45,687 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 13 states. [2019-09-16 16:14:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:14:46,049 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2019-09-16 16:14:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-16 16:14:46,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2019-09-16 16:14:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:14:46,051 INFO L225 Difference]: With dead ends: 83 [2019-09-16 16:14:46,051 INFO L226 Difference]: Without dead ends: 66 [2019-09-16 16:14:46,052 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-09-16 16:14:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-16 16:14:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-09-16 16:14:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-16 16:14:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-09-16 16:14:46,064 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 32 [2019-09-16 16:14:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:14:46,064 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-09-16 16:14:46,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 16:14:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-09-16 16:14:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:14:46,066 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:14:46,066 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:14:46,069 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:14:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:14:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash -42121234, now seen corresponding path program 3 times [2019-09-16 16:14:46,070 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:14:46,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:14:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:46,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:14:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:14:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:14:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-16 16:14:46,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:14:46,243 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:14:46,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:14:46,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-16 16:14:46,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:14:46,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-16 16:14:46,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:14:46,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:14:46,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:46,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:46,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:46,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-16 16:14:46,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:46,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:46,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:46,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-09-16 16:14:46,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:46,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:46,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:14:46,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-09-16 16:14:48,501 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (~SIZE~0 Int) (v_main_~acopy~0.base_BEFORE_CALL_2 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_2)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_2))) (and (let ((.cse1 (+ (* 4 ~SIZE~0) (- 8)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (mod ~SIZE~0 2) 0) (= (select .cse2 4) (select .cse0 4)) (not (= v_main_~a~0.base_BEFORE_CALL_2 v_main_~acopy~0.base_BEFORE_CALL_2))))) is different from true [2019-09-16 16:14:48,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:14:48,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-16 16:14:48,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:14:48,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:14:48,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:14:48,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-16 16:14:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2019-09-16 16:14:48,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:14:48,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-16 16:14:48,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-16 16:14:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-16 16:14:48,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2019-09-16 16:14:48,671 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 20 states. [2019-09-16 16:14:59,221 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-16 16:15:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:04,277 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-09-16 16:15:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-16 16:15:04,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-09-16 16:15:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:04,280 INFO L225 Difference]: With dead ends: 122 [2019-09-16 16:15:04,280 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 16:15:04,281 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=365, Invalid=1702, Unknown=7, NotChecked=88, Total=2162 [2019-09-16 16:15:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 16:15:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2019-09-16 16:15:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-16 16:15:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-09-16 16:15:04,294 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 34 [2019-09-16 16:15:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:04,294 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-09-16 16:15:04,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-16 16:15:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-09-16 16:15:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-16 16:15:04,295 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:04,295 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:04,296 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:04,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash -210369562, now seen corresponding path program 4 times [2019-09-16 16:15:04,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:04,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:04,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 16:15:04,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:04,361 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-16 16:15:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:15:04,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:15:04,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:04,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 16:15:04,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 16:15:04,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:04,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-16 16:15:04,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 16:15:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 16:15:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:15:04,472 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 13 states. [2019-09-16 16:15:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:04,654 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-09-16 16:15:04,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 16:15:04,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-16 16:15:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:04,656 INFO L225 Difference]: With dead ends: 89 [2019-09-16 16:15:04,657 INFO L226 Difference]: Without dead ends: 57 [2019-09-16 16:15:04,657 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-09-16 16:15:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-16 16:15:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-09-16 16:15:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-16 16:15:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2019-09-16 16:15:04,673 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2019-09-16 16:15:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:04,673 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2019-09-16 16:15:04,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 16:15:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2019-09-16 16:15:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 16:15:04,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:04,677 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:04,678 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:04,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:04,678 INFO L82 PathProgramCache]: Analyzing trace with hash -595219712, now seen corresponding path program 5 times [2019-09-16 16:15:04,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:04,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:04,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:04,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:05,397 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 39 [2019-09-16 16:15:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:15:05,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:05,957 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:05,978 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-16 16:15:06,036 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-16 16:15:06,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-16 16:15:06,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:06,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:06,352 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:15:06,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:06,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:06,357 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:15:06,378 INFO L341 Elim1Store]: treesize reduction 39, result has 36.1 percent of original size [2019-09-16 16:15:06,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 43 [2019-09-16 16:15:06,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:06,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:06,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:15:06,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:49 [2019-09-16 16:15:06,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:15:06,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:06,670 INFO L341 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2019-09-16 16:15:06,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 45 treesize of output 35 [2019-09-16 16:15:06,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:06,682 INFO L567 ElimStorePlain]: treesize reduction 8, result has 55.6 percent of original size [2019-09-16 16:15:06,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:06,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2019-09-16 16:15:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-16 16:15:06,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:06,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2019-09-16 16:15:06,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-16 16:15:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-16 16:15:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2019-09-16 16:15:06,756 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 35 states. [2019-09-16 16:15:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:08,783 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2019-09-16 16:15:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 16:15:08,784 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2019-09-16 16:15:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:08,785 INFO L225 Difference]: With dead ends: 112 [2019-09-16 16:15:08,785 INFO L226 Difference]: Without dead ends: 85 [2019-09-16 16:15:08,787 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=350, Invalid=2200, Unknown=0, NotChecked=0, Total=2550 [2019-09-16 16:15:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-16 16:15:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-09-16 16:15:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-16 16:15:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-09-16 16:15:08,801 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 44 [2019-09-16 16:15:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:08,801 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-09-16 16:15:08,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-16 16:15:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-09-16 16:15:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 16:15:08,803 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:08,803 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:08,804 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -310382338, now seen corresponding path program 6 times [2019-09-16 16:15:08,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:08,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:08,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:08,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 16:15:09,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:09,175 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:09,198 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-16 16:15:09,233 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-16 16:15:09,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:09,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-16 16:15:09,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:09,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:15:09,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:09,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-09-16 16:15:09,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-16 16:15:09,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:09,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-09-16 16:15:09,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-16 16:15:09,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,388 INFO L567 ElimStorePlain]: treesize reduction 3, result has 89.3 percent of original size [2019-09-16 16:15:09,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2019-09-16 16:15:09,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-16 16:15:09,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:09,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-16 16:15:09,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:09,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 101 [2019-09-16 16:15:09,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,538 INFO L567 ElimStorePlain]: treesize reduction 56, result has 53.7 percent of original size [2019-09-16 16:15:09,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:65 [2019-09-16 16:15:09,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:09,793 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-16 16:15:09,794 INFO L341 Elim1Store]: treesize reduction 90, result has 74.9 percent of original size [2019-09-16 16:15:09,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 337 [2019-09-16 16:15:09,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:09,894 INFO L567 ElimStorePlain]: treesize reduction 310, result has 27.2 percent of original size [2019-09-16 16:15:09,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:15:09,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:144, output treesize:116 [2019-09-16 16:15:09,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:09,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:12,136 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_5 Int) (v_main_~acopy~0.base_BEFORE_CALL_5 Int) (v_main_~a~0.base_BEFORE_CALL_5 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int) (~SIZE~0 Int)) (let ((.cse2 (* 4 ~SIZE~0)) (.cse3 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_5)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_5))) (and (let ((.cse1 (* (- 4) v_main_~i~0_41))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse1 .cse2 (- 4))) (select .cse3 (+ .cse1 .cse2 (- 4))))) (<= v_main_~i~0_42 (+ v_main_~i~0_41 1)) (<= (div ~SIZE~0 2) (+ v_main_~i~0_42 1)) (let ((.cse4 (* 4 v_main_~i~0_42))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse4)) (select .cse3 .cse4))) (not (= v_main_~a~0.base_BEFORE_CALL_5 v_main_~acopy~0.base_BEFORE_CALL_5)) (= (mod ~SIZE~0 2) 0) (<= v_main_~i~0_41 0) (<= 4 ~SIZE~0) (let ((.cse5 (* (- 4) v_main_~i~0_42))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse5 .cse2 (- 4))) (select .cse3 (+ .cse5 .cse2 (- 4))))) (let ((.cse6 (* 4 v_main_~i~0_41))) (= (select .cse3 .cse6) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_5 .cse6))))))) is different from true [2019-09-16 16:15:14,282 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.offset_BEFORE_CALL_6 Int) (v_main_~acopy~0.base_BEFORE_CALL_6 Int) (v_main_~i~0_42 Int) (v_main_~i~0_41 Int) (~SIZE~0 Int) (v_main_~a~0.base_BEFORE_CALL_6 Int)) (let ((.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_6)) (.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_6)) (.cse5 (* 4 ~SIZE~0))) (and (let ((.cse1 (* 4 v_main_~i~0_41))) (= (select .cse0 .cse1) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse1)))) (<= v_main_~i~0_42 (+ v_main_~i~0_41 1)) (let ((.cse3 (* 4 v_main_~i~0_42))) (= (select .cse0 .cse3) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse3)))) (<= (div ~SIZE~0 2) (+ v_main_~i~0_42 1)) (let ((.cse4 (* (- 4) v_main_~i~0_41))) (= (select .cse0 (+ .cse4 .cse5 (- 4))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse4 .cse5 (- 4))))) (= (mod ~SIZE~0 2) 0) (not (= v_main_~a~0.base_BEFORE_CALL_6 v_main_~acopy~0.base_BEFORE_CALL_6)) (<= v_main_~i~0_41 0) (<= 4 ~SIZE~0) (let ((.cse6 (* (- 4) v_main_~i~0_42))) (= (select .cse0 (+ .cse6 .cse5 (- 4))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_6 .cse6 .cse5 (- 4)))))))) is different from true [2019-09-16 16:15:14,447 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:15:14,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:14,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:14,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:14,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:14,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:14,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:14,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:14,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 7 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 203 [2019-09-16 16:15:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:14,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:14,610 INFO L567 ElimStorePlain]: treesize reduction 1172, result has 2.6 percent of original size [2019-09-16 16:15:14,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:14,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:3 [2019-09-16 16:15:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 8 not checked. [2019-09-16 16:15:14,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:14,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21] total 30 [2019-09-16 16:15:14,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-16 16:15:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-16 16:15:14,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=666, Unknown=2, NotChecked=106, Total=870 [2019-09-16 16:15:14,703 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 30 states. [2019-09-16 16:15:17,284 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-16 16:15:21,538 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-16 16:15:23,621 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-16 16:15:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:31,298 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-09-16 16:15:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-16 16:15:31,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2019-09-16 16:15:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:31,300 INFO L225 Difference]: With dead ends: 136 [2019-09-16 16:15:31,300 INFO L226 Difference]: Without dead ends: 111 [2019-09-16 16:15:31,302 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=403, Invalid=2906, Unknown=5, NotChecked=226, Total=3540 [2019-09-16 16:15:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-16 16:15:31,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2019-09-16 16:15:31,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-16 16:15:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-09-16 16:15:31,316 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 46 [2019-09-16 16:15:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:31,316 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-09-16 16:15:31,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-16 16:15:31,317 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-09-16 16:15:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 16:15:31,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:31,318 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:31,318 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:31,318 INFO L82 PathProgramCache]: Analyzing trace with hash -50327652, now seen corresponding path program 7 times [2019-09-16 16:15:31,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:31,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:31,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:31,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 16:15:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:31,560 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:15:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:31,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-16 16:15:31,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:15:31,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2019-09-16 16:15:31,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-16 16:15:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-16 16:15:31,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-16 16:15:31,739 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 17 states. [2019-09-16 16:15:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:32,114 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-09-16 16:15:32,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-16 16:15:32,115 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2019-09-16 16:15:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:32,117 INFO L225 Difference]: With dead ends: 133 [2019-09-16 16:15:32,117 INFO L226 Difference]: Without dead ends: 100 [2019-09-16 16:15:32,118 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2019-09-16 16:15:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-16 16:15:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2019-09-16 16:15:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-16 16:15:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-09-16 16:15:32,134 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 48 [2019-09-16 16:15:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:32,134 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-09-16 16:15:32,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-16 16:15:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-09-16 16:15:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 16:15:32,135 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:32,136 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:32,136 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash -615831910, now seen corresponding path program 8 times [2019-09-16 16:15:32,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:32,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:32,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:15:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 44 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-16 16:15:32,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:32,469 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-16 16:15:32,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:15:32,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:15:32,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:32,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-16 16:15:32,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:32,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:15:32,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:32,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:32,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:32,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-16 16:15:32,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:32,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:32,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:32,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2019-09-16 16:15:32,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:32,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:32,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:15:32,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:52 [2019-09-16 16:15:34,750 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_7 Int) (v_main_~a~0.base_BEFORE_CALL_7 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_7)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_7))) (and (= (mod ~SIZE~0 2) 0) (not (= v_main_~a~0.base_BEFORE_CALL_7 v_main_~acopy~0.base_BEFORE_CALL_7)) (let ((.cse1 (+ (* 4 ~SIZE~0) (- 12)))) (= (select .cse0 .cse1) (select .cse2 .cse1))) (= (select .cse2 8) (select .cse0 8))))) is different from true [2019-09-16 16:15:36,881 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_8 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int) (~SIZE~0 Int)) (let ((.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_8)) (.cse1 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_8))) (and (not (= v_main_~a~0.base_BEFORE_CALL_8 v_main_~acopy~0.base_BEFORE_CALL_8)) (= (mod ~SIZE~0 2) 0) (= (select .cse0 8) (select .cse1 8)) (let ((.cse2 (+ (* 4 ~SIZE~0) (- 12)))) (= (select .cse0 .cse2) (select .cse1 .cse2)))))) is different from true [2019-09-16 16:15:36,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:36,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 13 [2019-09-16 16:15:36,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:36,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:36,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:36,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2019-09-16 16:15:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 8 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-16 16:15:37,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2019-09-16 16:15:37,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-16 16:15:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-16 16:15:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=433, Unknown=2, NotChecked=86, Total=600 [2019-09-16 16:15:37,056 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 25 states. [2019-09-16 16:15:43,693 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-16 16:15:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:15:50,031 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-09-16 16:15:50,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-16 16:15:50,032 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-09-16 16:15:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:15:50,034 INFO L225 Difference]: With dead ends: 101 [2019-09-16 16:15:50,034 INFO L226 Difference]: Without dead ends: 99 [2019-09-16 16:15:50,035 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=129, Invalid=744, Unknown=5, NotChecked=114, Total=992 [2019-09-16 16:15:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-16 16:15:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2019-09-16 16:15:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-16 16:15:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-09-16 16:15:50,049 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 50 [2019-09-16 16:15:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:15:50,050 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-09-16 16:15:50,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-16 16:15:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-09-16 16:15:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 16:15:50,051 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:15:50,051 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:15:50,051 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:15:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:15:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash 958082708, now seen corresponding path program 9 times [2019-09-16 16:15:50,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:15:50,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:15:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:50,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:15:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:15:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:15:50,714 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 33 [2019-09-16 16:15:50,865 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2019-09-16 16:15:51,110 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 40 [2019-09-16 16:15:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 16:15:51,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:15:51,591 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:15:51,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 16:15:51,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-16 16:15:51,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:15:51,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-16 16:15:51,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:15:51,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:15:51,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:51,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:51,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:51,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-16 16:15:51,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-16 16:15:51,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:51,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:15:51,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:51,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-09-16 16:15:51,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:51,948 INFO L341 Elim1Store]: treesize reduction 36, result has 57.1 percent of original size [2019-09-16 16:15:51,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2019-09-16 16:15:51,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:51,982 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.8 percent of original size [2019-09-16 16:15:51,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:51,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:62 [2019-09-16 16:15:52,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 121 [2019-09-16 16:15:52,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:52,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:15:52,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 117 [2019-09-16 16:15:52,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:15:52,273 INFO L567 ElimStorePlain]: treesize reduction 107, result has 47.3 percent of original size [2019-09-16 16:15:52,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:52,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:259, output treesize:96 [2019-09-16 16:15:52,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:52,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:52,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:15:56,855 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-16 16:15:57,696 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-09-16 16:15:57,697 INFO L341 Elim1Store]: treesize reduction 56, result has 80.6 percent of original size [2019-09-16 16:15:57,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 91 treesize of output 251 [2019-09-16 16:15:57,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:57,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:15:58,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-16 16:15:58,663 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 518 DAG size of output: 19 [2019-09-16 16:15:58,664 INFO L567 ElimStorePlain]: treesize reduction 12149, result has 0.2 percent of original size [2019-09-16 16:15:58,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:15:58,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:116, output treesize:3 [2019-09-16 16:15:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-16 16:15:58,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:15:58,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-09-16 16:15:58,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-16 16:15:58,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-16 16:15:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1139, Unknown=1, NotChecked=0, Total=1260 [2019-09-16 16:15:58,760 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 36 states. [2019-09-16 16:16:06,903 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2019-09-16 16:16:07,097 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 47 [2019-09-16 16:16:09,291 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-16 16:16:11,581 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-16 16:16:11,849 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2019-09-16 16:16:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:12,627 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2019-09-16 16:16:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-16 16:16:12,628 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2019-09-16 16:16:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:12,629 INFO L225 Difference]: With dead ends: 106 [2019-09-16 16:16:12,629 INFO L226 Difference]: Without dead ends: 64 [2019-09-16 16:16:12,631 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=476, Invalid=2945, Unknown=1, NotChecked=0, Total=3422 [2019-09-16 16:16:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-16 16:16:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-09-16 16:16:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-16 16:16:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-16 16:16:12,643 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 52 [2019-09-16 16:16:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:12,644 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-16 16:16:12,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-16 16:16:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-16 16:16:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 16:16:12,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:12,645 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:16:12,645 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1251971026, now seen corresponding path program 10 times [2019-09-16 16:16:12,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:12,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:12,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:12,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:16:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-16 16:16:13,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:16:13,838 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:16:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-16 16:16:13,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-16 16:16:13,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:16:13,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-16 16:16:13,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:16:13,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-16 16:16:13,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:16:13,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:16:13,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:16:13,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-16 16:16:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:14,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:16:14,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:16:14,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:16:14,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 67 [2019-09-16 16:16:14,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:16:14,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:16:14,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:16:14,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:16:14,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-09-16 16:16:14,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:16:14,391 INFO L567 ElimStorePlain]: treesize reduction 70, result has 41.2 percent of original size [2019-09-16 16:16:14,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:16:14,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:49 [2019-09-16 16:16:16,540 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_12 Int) (v_main_~acopy~0.offset_BEFORE_CALL_12 Int) (v_main_~a~0.base_BEFORE_CALL_12 Int) (v_main_~a~0.offset_BEFORE_CALL_12 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_12)) (.cse0 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_12))) (and (let ((.cse1 (* 4 ~SIZE~0))) (= (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_12 .cse1 (- 12))) (select .cse2 (+ v_main_~a~0.offset_BEFORE_CALL_12 .cse1 (- 12))))) (< 2 (div ~SIZE~0 2)) (not (= v_main_~acopy~0.base_BEFORE_CALL_12 v_main_~a~0.base_BEFORE_CALL_12)) (<= ~SIZE~0 6) (= (select .cse2 (+ v_main_~a~0.offset_BEFORE_CALL_12 8)) (select .cse0 (+ v_main_~acopy~0.offset_BEFORE_CALL_12 8)))))) is different from true [2019-09-16 16:16:18,703 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_13 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_main_~acopy~0.offset_BEFORE_CALL_13 Int) (~SIZE~0 Int)) (let ((.cse2 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_13)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_13))) (and (< 2 (div ~SIZE~0 2)) (let ((.cse1 (* 4 ~SIZE~0))) (= (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_13 .cse1 (- 12))) (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_13 .cse1 (- 12))))) (not (= v_main_~acopy~0.base_BEFORE_CALL_13 v_main_~a~0.base_BEFORE_CALL_13)) (<= ~SIZE~0 6) (= (select .cse2 (+ v_main_~acopy~0.offset_BEFORE_CALL_13 8)) (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_13 8)))))) is different from true [2019-09-16 16:16:20,844 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~acopy~0.base_BEFORE_CALL_14 Int) (v_main_~a~0.offset_BEFORE_CALL_14 Int) (v_main_~a~0.base_BEFORE_CALL_14 Int) (v_main_~acopy~0.offset_BEFORE_CALL_14 Int) (~SIZE~0 Int)) (let ((.cse1 (select |c_#memory_int| v_main_~acopy~0.base_BEFORE_CALL_14)) (.cse0 (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_14))) (and (< 2 (div ~SIZE~0 2)) (<= ~SIZE~0 6) (= (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_14 8)) (select .cse1 (+ v_main_~acopy~0.offset_BEFORE_CALL_14 8))) (not (= v_main_~acopy~0.base_BEFORE_CALL_14 v_main_~a~0.base_BEFORE_CALL_14)) (let ((.cse2 (* 4 ~SIZE~0))) (= (select .cse1 (+ v_main_~acopy~0.offset_BEFORE_CALL_14 .cse2 (- 12))) (select .cse0 (+ v_main_~a~0.offset_BEFORE_CALL_14 .cse2 (- 12)))))))) is different from true [2019-09-16 16:16:21,076 INFO L341 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2019-09-16 16:16:21,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 73 [2019-09-16 16:16:21,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:21,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:21,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:21,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:21,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-09-16 16:16:21,100 INFO L567 ElimStorePlain]: treesize reduction 61, result has 20.8 percent of original size [2019-09-16 16:16:21,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:16:21,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:3 [2019-09-16 16:16:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2019-09-16 16:16:21,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:16:21,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2019-09-16 16:16:21,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-16 16:16:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-16 16:16:21,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1553, Unknown=3, NotChecked=246, Total=1980 [2019-09-16 16:16:21,197 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 45 states. [2019-09-16 16:16:29,182 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-16 16:16:33,434 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-16 16:16:35,507 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-16 16:16:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:42,650 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2019-09-16 16:16:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-16 16:16:42,651 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 58 [2019-09-16 16:16:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:42,653 INFO L225 Difference]: With dead ends: 156 [2019-09-16 16:16:42,653 INFO L226 Difference]: Without dead ends: 121 [2019-09-16 16:16:42,655 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=770, Invalid=4783, Unknown=9, NotChecked=444, Total=6006 [2019-09-16 16:16:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-16 16:16:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2019-09-16 16:16:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-16 16:16:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-09-16 16:16:42,670 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 58 [2019-09-16 16:16:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:42,670 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-09-16 16:16:42,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-16 16:16:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-09-16 16:16:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 16:16:42,671 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:42,671 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:16:42,671 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash -734961236, now seen corresponding path program 11 times [2019-09-16 16:16:42,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:42,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:16:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 16:16:43,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:16:43,141 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:16:43,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-16 16:16:43,423 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-16 16:16:43,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:16:43,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-16 16:16:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:16:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-16 16:16:43,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:16:43,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2019-09-16 16:16:43,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-16 16:16:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-16 16:16:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2019-09-16 16:16:43,758 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 26 states. [2019-09-16 16:16:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:44,771 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2019-09-16 16:16:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-16 16:16:44,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2019-09-16 16:16:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:44,774 INFO L225 Difference]: With dead ends: 175 [2019-09-16 16:16:44,774 INFO L226 Difference]: Without dead ends: 142 [2019-09-16 16:16:44,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-09-16 16:16:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-16 16:16:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 82. [2019-09-16 16:16:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-16 16:16:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-09-16 16:16:44,790 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 60 [2019-09-16 16:16:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:44,790 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-09-16 16:16:44,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-16 16:16:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-09-16 16:16:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 16:16:44,791 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:44,791 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:16:44,791 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2090228790, now seen corresponding path program 12 times [2019-09-16 16:16:44,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:44,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:44,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:44,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:16:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-16 16:16:45,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:16:45,080 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-16 16:16:45,113 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-16 16:16:45,204 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-16 16:16:45,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:16:45,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-16 16:16:45,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:16:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 49 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-16 16:16:45,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:16:45,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2019-09-16 16:16:45,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-16 16:16:45,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-16 16:16:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-09-16 16:16:45,304 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 21 states. [2019-09-16 16:16:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:16:45,850 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2019-09-16 16:16:45,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-16 16:16:45,851 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-16 16:16:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:16:45,853 INFO L225 Difference]: With dead ends: 171 [2019-09-16 16:16:45,853 INFO L226 Difference]: Without dead ends: 128 [2019-09-16 16:16:45,854 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2019-09-16 16:16:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-16 16:16:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 84. [2019-09-16 16:16:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-16 16:16:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2019-09-16 16:16:45,872 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 62 [2019-09-16 16:16:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:16:45,872 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2019-09-16 16:16:45,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-16 16:16:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2019-09-16 16:16:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 16:16:45,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:16:45,873 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:16:45,873 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:16:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:16:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 88712776, now seen corresponding path program 13 times [2019-09-16 16:16:45,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:16:45,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:16:45,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:45,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:16:45,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:16:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 82 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-16 16:16:46,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:16:46,215 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:16:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:16:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:16:46,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-16 16:16:46,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:16:46,707 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-16 16:16:46,707 INFO L341 Elim1Store]: treesize reduction 357, result has 32.6 percent of original size [2019-09-16 16:16:46,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 229 [2019-09-16 16:16:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:16:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:16:46,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:16:46,956 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 16:16:46,962 INFO L168 Benchmark]: Toolchain (without parser) took 140593.82 ms. Allocated memory was 130.5 MB in the beginning and 452.5 MB in the end (delta: 321.9 MB). Free memory was 86.7 MB in the beginning and 226.6 MB in the end (delta: -139.9 MB). Peak memory consumption was 182.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:16:46,963 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:16:46,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.63 ms. Allocated memory is still 130.5 MB. Free memory was 86.5 MB in the beginning and 76.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:16:46,964 INFO L168 Benchmark]: Boogie Preprocessor took 123.28 ms. Allocated memory was 130.5 MB in the beginning and 197.1 MB in the end (delta: 66.6 MB). Free memory was 76.4 MB in the beginning and 172.7 MB in the end (delta: -96.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:16:46,964 INFO L168 Benchmark]: RCFGBuilder took 301.08 ms. Allocated memory is still 197.1 MB. Free memory was 172.7 MB in the beginning and 156.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:16:46,965 INFO L168 Benchmark]: TraceAbstraction took 139874.68 ms. Allocated memory was 197.1 MB in the beginning and 452.5 MB in the end (delta: 255.3 MB). Free memory was 155.9 MB in the beginning and 226.6 MB in the end (delta: -70.7 MB). Peak memory consumption was 184.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:16:46,967 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 290.63 ms. Allocated memory is still 130.5 MB. Free memory was 86.5 MB in the beginning and 76.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.28 ms. Allocated memory was 130.5 MB in the beginning and 197.1 MB in the end (delta: 66.6 MB). Free memory was 76.4 MB in the beginning and 172.7 MB in the end (delta: -96.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 301.08 ms. Allocated memory is still 197.1 MB. Free memory was 172.7 MB in the beginning and 156.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139874.68 ms. Allocated memory was 197.1 MB in the beginning and 452.5 MB in the end (delta: 255.3 MB). Free memory was 155.9 MB in the beginning and 226.6 MB in the end (delta: -70.7 MB). Peak memory consumption was 184.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...