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/revcpyswp2.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-fea9116
[2019-09-20 12:59:18,452 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-09-20 12:59:18,455 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-09-20 12:59:18,467 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-09-20 12:59:18,467 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-09-20 12:59:18,469 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-09-20 12:59:18,470 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-09-20 12:59:18,472 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-09-20 12:59:18,474 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-09-20 12:59:18,475 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-09-20 12:59:18,476 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-09-20 12:59:18,477 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-09-20 12:59:18,478 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-09-20 12:59:18,479 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-09-20 12:59:18,480 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-09-20 12:59:18,481 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-09-20 12:59:18,482 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-09-20 12:59:18,483 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-09-20 12:59:18,484 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-09-20 12:59:18,486 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-09-20 12:59:18,488 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-09-20 12:59:18,489 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-09-20 12:59:18,490 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-09-20 12:59:18,491 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-09-20 12:59:18,493 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-09-20 12:59:18,493 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-09-20 12:59:18,493 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-09-20 12:59:18,494 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-09-20 12:59:18,495 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-09-20 12:59:18,496 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-09-20 12:59:18,496 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-09-20 12:59:18,497 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-09-20 12:59:18,498 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-09-20 12:59:18,498 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-09-20 12:59:18,499 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-09-20 12:59:18,500 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-09-20 12:59:18,500 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-09-20 12:59:18,501 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-09-20 12:59:18,501 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-09-20 12:59:18,502 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-09-20 12:59:18,503 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-09-20 12:59:18,503 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-20 12:59:18,519 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-09-20 12:59:18,519 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-09-20 12:59:18,520 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-09-20 12:59:18,520 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-09-20 12:59:18,521 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-09-20 12:59:18,521 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-09-20 12:59:18,521 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-09-20 12:59:18,521 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-09-20 12:59:18,522 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-09-20 12:59:18,522 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-09-20 12:59:18,522 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-09-20 12:59:18,522 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-09-20 12:59:18,522 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-09-20 12:59:18,523 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-09-20 12:59:18,523 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-09-20 12:59:18,523 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-09-20 12:59:18,523 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-09-20 12:59:18,523 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-09-20 12:59:18,524 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-09-20 12:59:18,524 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-09-20 12:59:18,524 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-09-20 12:59:18,524 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-09-20 12:59:18,525 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-09-20 12:59:18,525 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-09-20 12:59:18,525 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-09-20 12:59:18,525 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-09-20 12:59:18,525 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-09-20 12:59:18,526 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-09-20 12:59:18,526 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-09-20 12:59:18,555 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-09-20 12:59:18,567 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-09-20 12:59:18,571 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-09-20 12:59:18,572 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-09-20 12:59:18,573 INFO  L275        PluginConnector]: CDTParser initialized
[2019-09-20 12:59:18,574 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c
[2019-09-20 12:59:18,638 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c66ca451/a0d8faf2b2854c0d835b68583b979376/FLAG95dc997ce
[2019-09-20 12:59:19,147 INFO  L306              CDTParser]: Found 1 translation units.
[2019-09-20 12:59:19,148 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c
[2019-09-20 12:59:19,157 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c66ca451/a0d8faf2b2854c0d835b68583b979376/FLAG95dc997ce
[2019-09-20 12:59:19,479 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c66ca451/a0d8faf2b2854c0d835b68583b979376
[2019-09-20 12:59:19,493 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-09-20 12:59:19,495 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-09-20 12:59:19,498 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-09-20 12:59:19,498 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-09-20 12:59:19,501 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-09-20 12:59:19,502 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,505 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50383ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19, skipping insertion in model container
[2019-09-20 12:59:19,506 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,513 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-09-20 12:59:19,534 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-09-20 12:59:19,764 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-20 12:59:19,776 INFO  L188         MainTranslator]: Completed pre-run
[2019-09-20 12:59:19,885 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-09-20 12:59:19,902 INFO  L192         MainTranslator]: Completed translation
[2019-09-20 12:59:19,903 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19 WrapperNode
[2019-09-20 12:59:19,903 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-09-20 12:59:19,904 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-09-20 12:59:19,904 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-09-20 12:59:19,904 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-09-20 12:59:19,918 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,918 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,927 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,927 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,937 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,944 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,945 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (1/1) ...
[2019-09-20 12:59:19,951 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-09-20 12:59:19,951 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-09-20 12:59:19,951 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-09-20 12:59:19,951 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-09-20 12:59:19,952 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (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-20 12:59:20,012 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-09-20 12:59:20,012 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-09-20 12:59:20,012 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2019-09-20 12:59:20,012 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-09-20 12:59:20,013 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-09-20 12:59:20,013 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-09-20 12:59:20,013 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2019-09-20 12:59:20,014 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-09-20 12:59:20,014 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2019-09-20 12:59:20,014 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-09-20 12:59:20,014 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2019-09-20 12:59:20,014 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2019-09-20 12:59:20,015 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2019-09-20 12:59:20,015 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-09-20 12:59:20,015 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-09-20 12:59:20,015 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-09-20 12:59:20,350 INFO  L278             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-09-20 12:59:20,350 INFO  L283             CfgBuilder]: Removed 5 assume(true) statements.
[2019-09-20 12:59:20,352 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:20 BoogieIcfgContainer
[2019-09-20 12:59:20,352 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-09-20 12:59:20,362 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-09-20 12:59:20,362 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-09-20 12:59:20,368 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-09-20 12:59:20,369 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:19" (1/3) ...
[2019-09-20 12:59:20,373 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f75e213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:20, skipping insertion in model container
[2019-09-20 12:59:20,373 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:19" (2/3) ...
[2019-09-20 12:59:20,374 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f75e213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:20, skipping insertion in model container
[2019-09-20 12:59:20,374 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:20" (3/3) ...
[2019-09-20 12:59:20,376 INFO  L109   eAbstractionObserver]: Analyzing ICFG revcpyswp2.c
[2019-09-20 12:59:20,390 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-09-20 12:59:20,405 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-09-20 12:59:20,431 INFO  L252      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-09-20 12:59:20,471 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2019-09-20 12:59:20,472 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2019-09-20 12:59:20,472 INFO  L378      AbstractCegarLoop]: Hoare is true
[2019-09-20 12:59:20,472 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-09-20 12:59:20,472 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-09-20 12:59:20,472 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-09-20 12:59:20,473 INFO  L382      AbstractCegarLoop]: Difference is false
[2019-09-20 12:59:20,473 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-09-20 12:59:20,473 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-09-20 12:59:20,496 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states.
[2019-09-20 12:59:20,504 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-09-20 12:59:20,505 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 12:59:20,505 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-20 12:59:20,507 INFO  L418      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 12:59:20,512 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 12:59:20,512 INFO  L82        PathProgramCache]: Analyzing trace with hash -285010775, now seen corresponding path program 1 times
[2019-09-20 12:59:20,513 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 12:59:20,514 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 12:59:20,559 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:20,559 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-20 12:59:20,559 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:20,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:20,661 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-20 12:59:20,664 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-20 12:59:20,664 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-09-20 12:59:20,668 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-09-20 12:59:20,682 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-09-20 12:59:20,683 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-09-20 12:59:20,685 INFO  L87              Difference]: Start difference. First operand 34 states. Second operand 2 states.
[2019-09-20 12:59:20,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-20 12:59:20,712 INFO  L93              Difference]: Finished difference Result 59 states and 79 transitions.
[2019-09-20 12:59:20,713 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2019-09-20 12:59:20,714 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 20
[2019-09-20 12:59:20,715 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-20 12:59:20,723 INFO  L225             Difference]: With dead ends: 59
[2019-09-20 12:59:20,724 INFO  L226             Difference]: Without dead ends: 29
[2019-09-20 12:59:20,728 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-20 12:59:20,747 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2019-09-20 12:59:20,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29.
[2019-09-20 12:59:20,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2019-09-20 12:59:20,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions.
[2019-09-20 12:59:20,771 INFO  L78                 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20
[2019-09-20 12:59:20,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-20 12:59:20,772 INFO  L475      AbstractCegarLoop]: Abstraction has 29 states and 33 transitions.
[2019-09-20 12:59:20,772 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-09-20 12:59:20,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions.
[2019-09-20 12:59:20,773 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2019-09-20 12:59:20,773 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 12:59:20,773 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-20 12:59:20,774 INFO  L418      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 12:59:20,774 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 12:59:20,774 INFO  L82        PathProgramCache]: Analyzing trace with hash 1627005719, now seen corresponding path program 1 times
[2019-09-20 12:59:20,774 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 12:59:20,775 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 12:59:20,777 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:20,777 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-20 12:59:20,777 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:20,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:20,908 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-20 12:59:20,908 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-20 12:59:20,908 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-09-20 12:59:20,915 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-09-20 12:59:20,915 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-09-20 12:59:20,916 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-09-20 12:59:20,916 INFO  L87              Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states.
[2019-09-20 12:59:21,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-20 12:59:21,014 INFO  L93              Difference]: Finished difference Result 51 states and 59 transitions.
[2019-09-20 12:59:21,015 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-09-20 12:59:21,015 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2019-09-20 12:59:21,015 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-20 12:59:21,017 INFO  L225             Difference]: With dead ends: 51
[2019-09-20 12:59:21,017 INFO  L226             Difference]: Without dead ends: 31
[2019-09-20 12:59:21,018 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-20 12:59:21,019 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2019-09-20 12:59:21,028 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30.
[2019-09-20 12:59:21,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2019-09-20 12:59:21,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions.
[2019-09-20 12:59:21,034 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20
[2019-09-20 12:59:21,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-20 12:59:21,035 INFO  L475      AbstractCegarLoop]: Abstraction has 30 states and 34 transitions.
[2019-09-20 12:59:21,035 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-09-20 12:59:21,035 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions.
[2019-09-20 12:59:21,037 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2019-09-20 12:59:21,038 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 12:59:21,038 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, 1, 1]
[2019-09-20 12:59:21,039 INFO  L418      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 12:59:21,039 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 12:59:21,039 INFO  L82        PathProgramCache]: Analyzing trace with hash -381446827, now seen corresponding path program 1 times
[2019-09-20 12:59:21,040 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 12:59:21,040 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 12:59:21,046 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:21,046 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-20 12:59:21,047 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:21,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:21,141 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-20 12:59:21,141 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-09-20 12:59:21,142 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-09-20 12:59:21,143 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-09-20 12:59:21,144 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-09-20 12:59:21,144 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-09-20 12:59:21,144 INFO  L87              Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states.
[2019-09-20 12:59:21,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-20 12:59:21,251 INFO  L93              Difference]: Finished difference Result 58 states and 68 transitions.
[2019-09-20 12:59:21,251 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-09-20 12:59:21,251 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2019-09-20 12:59:21,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-20 12:59:21,254 INFO  L225             Difference]: With dead ends: 58
[2019-09-20 12:59:21,254 INFO  L226             Difference]: Without dead ends: 41
[2019-09-20 12:59:21,255 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-20 12:59:21,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2019-09-20 12:59:21,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33.
[2019-09-20 12:59:21,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2019-09-20 12:59:21,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions.
[2019-09-20 12:59:21,267 INFO  L78                 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22
[2019-09-20 12:59:21,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-20 12:59:21,268 INFO  L475      AbstractCegarLoop]: Abstraction has 33 states and 37 transitions.
[2019-09-20 12:59:21,268 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-09-20 12:59:21,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions.
[2019-09-20 12:59:21,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2019-09-20 12:59:21,269 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 12:59:21,269 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-20 12:59:21,270 INFO  L418      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 12:59:21,270 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 12:59:21,270 INFO  L82        PathProgramCache]: Analyzing trace with hash -1677394545, now seen corresponding path program 1 times
[2019-09-20 12:59:21,270 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 12:59:21,270 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 12:59:21,272 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:21,272 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-20 12:59:21,272 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:21,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:21,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-09-20 12:59:21,379 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-20 12:59:21,379 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-20 12:59:21,420 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-20 12:59:21,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:21,480 INFO  L256         TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core
[2019-09-20 12:59:21,489 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-09-20 12:59:21,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-09-20 12:59:21,570 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-09-20 12:59:21,570 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6
[2019-09-20 12:59:21,570 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-09-20 12:59:21,571 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-09-20 12:59:21,571 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2019-09-20 12:59:21,572 INFO  L87              Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states.
[2019-09-20 12:59:21,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-20 12:59:21,684 INFO  L93              Difference]: Finished difference Result 59 states and 67 transitions.
[2019-09-20 12:59:21,684 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-09-20 12:59:21,684 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 28
[2019-09-20 12:59:21,684 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-20 12:59:21,685 INFO  L225             Difference]: With dead ends: 59
[2019-09-20 12:59:21,685 INFO  L226             Difference]: Without dead ends: 36
[2019-09-20 12:59:21,686 INFO  L636         BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-20 12:59:21,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2019-09-20 12:59:21,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35.
[2019-09-20 12:59:21,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2019-09-20 12:59:21,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions.
[2019-09-20 12:59:21,693 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28
[2019-09-20 12:59:21,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-20 12:59:21,693 INFO  L475      AbstractCegarLoop]: Abstraction has 35 states and 39 transitions.
[2019-09-20 12:59:21,694 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-09-20 12:59:21,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions.
[2019-09-20 12:59:21,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2019-09-20 12:59:21,695 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 12:59:21,695 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-20 12:59:21,695 INFO  L418      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 12:59:21,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 12:59:21,696 INFO  L82        PathProgramCache]: Analyzing trace with hash 760173005, now seen corresponding path program 2 times
[2019-09-20 12:59:21,696 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 12:59:21,696 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 12:59:21,697 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:21,698 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-09-20 12:59:21,698 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:21,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:21,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-09-20 12:59:21,792 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-20 12:59:21,792 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-20 12:59:21,820 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-20 12:59:21,862 INFO  L249   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2019-09-20 12:59:21,863 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2019-09-20 12:59:21,864 INFO  L256         TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core
[2019-09-20 12:59:21,866 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-09-20 12:59:21,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-09-20 12:59:21,905 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-09-20 12:59:21,905 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2019-09-20 12:59:21,905 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-09-20 12:59:21,906 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-09-20 12:59:21,906 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2019-09-20 12:59:21,906 INFO  L87              Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states.
[2019-09-20 12:59:22,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-20 12:59:22,077 INFO  L93              Difference]: Finished difference Result 72 states and 83 transitions.
[2019-09-20 12:59:22,077 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2019-09-20 12:59:22,077 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 30
[2019-09-20 12:59:22,078 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-20 12:59:22,079 INFO  L225             Difference]: With dead ends: 72
[2019-09-20 12:59:22,079 INFO  L226             Difference]: Without dead ends: 53
[2019-09-20 12:59:22,079 INFO  L636         BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56
[2019-09-20 12:59:22,080 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2019-09-20 12:59:22,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41.
[2019-09-20 12:59:22,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2019-09-20 12:59:22,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions.
[2019-09-20 12:59:22,088 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30
[2019-09-20 12:59:22,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-20 12:59:22,088 INFO  L475      AbstractCegarLoop]: Abstraction has 41 states and 45 transitions.
[2019-09-20 12:59:22,088 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-09-20 12:59:22,088 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions.
[2019-09-20 12:59:22,089 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2019-09-20 12:59:22,089 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 12:59:22,090 INFO  L407         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-20 12:59:22,090 INFO  L418      AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 12:59:22,090 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 12:59:22,090 INFO  L82        PathProgramCache]: Analyzing trace with hash 1484472327, now seen corresponding path program 3 times
[2019-09-20 12:59:22,091 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 12:59:22,091 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 12:59:22,092 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:22,092 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2019-09-20 12:59:22,092 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 12:59:22,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 12:59:23,392 WARN  L191               SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37
[2019-09-20 12:59:23,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-20 12:59:23,520 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-20 12:59:23,520 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)
[2019-09-20 12:59:23,546 INFO  L103   rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-09-20 12:59:23,593 INFO  L249   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2019-09-20 12:59:23,594 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2019-09-20 12:59:23,596 INFO  L256         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 65 conjunts are in the unsatisfiable core
[2019-09-20 12:59:23,601 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-09-20 12:59:23,685 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:23,690 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58
[2019-09-20 12:59:23,692 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:23,715 INFO  L567         ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:23,716 INFO  L496         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:23,716 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40
[2019-09-20 12:59:23,815 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23
[2019-09-20 12:59:23,816 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:23,842 INFO  L567         ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:23,844 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-20 12:59:23,844 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:40
[2019-09-20 12:59:23,990 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:23,996 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 53
[2019-09-20 12:59:23,997 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:24,041 INFO  L567         ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:24,042 INFO  L496         ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars,  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:24,042 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:89
[2019-09-20 12:59:24,209 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,219 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,223 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,225 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,235 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:24,236 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 118
[2019-09-20 12:59:24,237 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:24,322 INFO  L567         ElimStorePlain]: treesize reduction 38, result has 76.1 percent of original size
[2019-09-20 12:59:24,324 INFO  L496         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars,  End of recursive call: 3 dim-0 vars,  and 1 xjuncts.
[2019-09-20 12:59:24,325 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:174, output treesize:121
[2019-09-20 12:59:24,571 INFO  L172   IndexEqualityManager]: detected equality via solver
[2019-09-20 12:59:24,579 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,580 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,581 INFO  L172   IndexEqualityManager]: detected equality via solver
[2019-09-20 12:59:24,585 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,599 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:24,600 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 132
[2019-09-20 12:59:24,604 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:24,699 INFO  L567         ElimStorePlain]: treesize reduction 42, result has 75.9 percent of original size
[2019-09-20 12:59:24,701 INFO  L496         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars,  End of recursive call: 3 dim-0 vars,  and 1 xjuncts.
[2019-09-20 12:59:24,702 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:187, output treesize:132
[2019-09-20 12:59:24,919 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,921 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,923 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,925 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,926 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:24,972 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:24,972 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 4 case distinctions, treesize of input 124 treesize of output 220
[2019-09-20 12:59:24,975 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:25,105 WARN  L191               SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73
[2019-09-20 12:59:25,106 INFO  L567         ElimStorePlain]: treesize reduction 92, result has 66.4 percent of original size
[2019-09-20 12:59:25,108 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,109 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,110 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,116 INFO  L496         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars,  End of recursive call: 3 dim-0 vars,  and 1 xjuncts.
[2019-09-20 12:59:25,116 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:166, output treesize:173
[2019-09-20 12:59:25,117 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,118 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,119 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,252 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,252 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,253 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,256 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,257 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,610 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,611 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,611 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,613 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:25,615 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:28,045 WARN  L191               SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74
[2019-09-20 12:59:28,257 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:28,265 INFO  L392         ElimStorePlain]: Different costs {54=[|v_#memory_int_21|], 88=[v_prenex_5]}
[2019-09-20 12:59:28,275 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:28,279 INFO  L341             Elim1Store]: treesize reduction 17, result has 5.6 percent of original size
[2019-09-20 12:59:28,279 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 108
[2019-09-20 12:59:28,281 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:28,400 WARN  L191               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 96
[2019-09-20 12:59:28,401 INFO  L567         ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:28,415 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:28,419 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:28,423 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:28,438 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:28,438 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 172
[2019-09-20 12:59:28,440 INFO  L496         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:28,652 WARN  L191               SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80
[2019-09-20 12:59:28,652 INFO  L567         ElimStorePlain]: treesize reduction 42, result has 82.6 percent of original size
[2019-09-20 12:59:28,655 INFO  L496         ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars,  End of recursive call: 5 dim-0 vars,  and 2 xjuncts.
[2019-09-20 12:59:28,655 INFO  L221         ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:288, output treesize:186
[2019-09-20 12:59:28,851 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:28,864 INFO  L392         ElimStorePlain]: Different costs {40=[|v_#memory_int_22|], 70=[v_prenex_8]}
[2019-09-20 12:59:28,876 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:28,902 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:28,903 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 157
[2019-09-20 12:59:28,905 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:29,168 WARN  L191               SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 102
[2019-09-20 12:59:29,169 INFO  L567         ElimStorePlain]: treesize reduction 52, result has 83.0 percent of original size
[2019-09-20 12:59:29,185 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:29,190 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2019-09-20 12:59:29,237 INFO  L341             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:29,238 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 155 treesize of output 242
[2019-09-20 12:59:29,241 INFO  L496         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:29,516 WARN  L191               SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99
[2019-09-20 12:59:29,517 INFO  L567         ElimStorePlain]: treesize reduction 74, result has 78.7 percent of original size
[2019-09-20 12:59:29,518 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,519 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,519 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,522 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,523 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,525 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,526 INFO  L496         ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2019-09-20 12:59:29,527 INFO  L221         ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:276, output treesize:244
[2019-09-20 12:59:29,527 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,528 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,528 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,528 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,530 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:29,530 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,012 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,013 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,013 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,014 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,014 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,015 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,019 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,020 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,021 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,023 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,023 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,024 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,025 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,028 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,029 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,030 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,030 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,031 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,032 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,033 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:30,034 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-09-20 12:59:33,061 WARN  L191               SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100
[2019-09-20 12:59:33,064 INFO  L319       QuantifierPusher]: Applying distributivity, recursing on 6 terms
[2019-09-20 12:59:33,401 INFO  L375             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10
[2019-09-20 12:59:33,402 INFO  L496         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2019-09-20 12:59:33,408 INFO  L567         ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-09-20 12:59:33,409 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-20 12:59:33,409 INFO  L221         ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3
[2019-09-20 12:59:33,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-09-20 12:59:33,506 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2019-09-20 12:59:33,506 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 40
[2019-09-20 12:59:33,507 INFO  L454      AbstractCegarLoop]: Interpolant automaton has 40 states
[2019-09-20 12:59:33,507 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2019-09-20 12:59:33,509 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1338, Unknown=2, NotChecked=0, Total=1560
[2019-09-20 12:59:33,509 INFO  L87              Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 40 states.
[2019-09-20 12:59:40,274 WARN  L191               SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 105 DAG size of output: 60
[2019-09-20 12:59:42,597 WARN  L191               SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 64
[2019-09-20 12:59:42,980 WARN  L191               SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 64
[2019-09-20 12:59:45,961 WARN  L191               SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 82
[2019-09-20 12:59:46,201 WARN  L191               SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83
[2019-09-20 12:59:46,808 WARN  L191               SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89
[2019-09-20 12:59:47,245 WARN  L191               SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83
[2019-09-20 12:59:47,863 WARN  L191               SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 83
[2019-09-20 12:59:52,197 WARN  L191               SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 110 DAG size of output: 55
[2019-09-20 12:59:53,243 WARN  L191               SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53
[2019-09-20 12:59:53,631 WARN  L191               SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 54
[2019-09-20 12:59:59,814 WARN  L191               SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 42
[2019-09-20 13:00:00,061 WARN  L191               SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 42
[2019-09-20 13:00:06,400 WARN  L191               SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 43
[2019-09-20 13:00:06,483 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-09-20 13:00:06,484 INFO  L93              Difference]: Finished difference Result 143 states and 167 transitions.
[2019-09-20 13:00:06,484 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. 
[2019-09-20 13:00:06,484 INFO  L78                 Accepts]: Start accepts. Automaton has 40 states. Word has length 36
[2019-09-20 13:00:06,485 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-09-20 13:00:06,487 INFO  L225             Difference]: With dead ends: 143
[2019-09-20 13:00:06,487 INFO  L226             Difference]: Without dead ends: 141
[2019-09-20 13:00:06,492 INFO  L636         BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2212 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=968, Invalid=5508, Unknown=4, NotChecked=0, Total=6480
[2019-09-20 13:00:06,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2019-09-20 13:00:06,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 78.
[2019-09-20 13:00:06,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2019-09-20 13:00:06,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions.
[2019-09-20 13:00:06,520 INFO  L78                 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 36
[2019-09-20 13:00:06,520 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-09-20 13:00:06,521 INFO  L475      AbstractCegarLoop]: Abstraction has 78 states and 89 transitions.
[2019-09-20 13:00:06,521 INFO  L476      AbstractCegarLoop]: Interpolant automaton has 40 states.
[2019-09-20 13:00:06,521 INFO  L276                IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions.
[2019-09-20 13:00:06,522 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2019-09-20 13:00:06,522 INFO  L399         BasicCegarLoop]: Found error trace
[2019-09-20 13:00:06,522 INFO  L407         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-09-20 13:00:06,523 INFO  L418      AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-09-20 13:00:06,523 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-09-20 13:00:06,523 INFO  L82        PathProgramCache]: Analyzing trace with hash 973091907, now seen corresponding path program 4 times
[2019-09-20 13:00:06,523 INFO  L224   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2019-09-20 13:00:06,523 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2019-09-20 13:00:06,525 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 13:00:06,525 INFO  L101   rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2019-09-20 13:00:06,525 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-09-20 13:00:06,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-09-20 13:00:06,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-09-20 13:00:06,614 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-09-20 13:00:06,614 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-20 13:00:06,638 INFO  L103   rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2019-09-20 13:00:06,675 INFO  L249   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2019-09-20 13:00:06,676 INFO  L250   tOrderPrioritization]: Conjunction of SSA is unsat
[2019-09-20 13:00:06,677 INFO  L256         TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core
[2019-09-20 13:00:06,681 INFO  L279         TraceCheckSpWp]: Computing forward predicates...