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/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:27:19,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:27:19,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:27:19,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:27:19,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:27:19,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:27:19,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:27:19,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:27:19,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:27:19,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:27:19,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:27:19,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:27:19,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:27:19,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:27:19,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:27:19,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:27:19,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:27:19,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:27:19,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:27:19,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:27:19,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:27:19,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:27:19,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:27:19,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:27:19,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:27:19,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:27:19,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:27:19,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:27:19,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:27:19,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:27:19,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:27:19,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:27:19,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:27:19,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:27:19,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:27:19,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:27:19,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:27:19,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:27:19,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:27:19,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:27:19,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:27:19,463 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-10-02 11:27:19,482 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:27:19,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:27:19,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:27:19,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:27:19,484 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:27:19,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:27:19,484 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:27:19,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:27:19,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:27:19,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:27:19,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:27:19,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:27:19,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:27:19,485 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:27:19,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:27:19,486 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:27:19,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:27:19,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:27:19,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:27:19,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:27:19,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:27:19,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:27:19,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:27:19,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:27:19,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:27:19,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:27:19,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:27:19,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:27:19,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:27:19,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:27:19,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:27:19,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:27:19,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:27:19,534 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:27:19,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2019-10-02 11:27:19,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1587d1ca/3b51cb14eee34f9a90068d1e0345b0e0/FLAG151a69cad [2019-10-02 11:27:20,033 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:27:20,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-10-02 11:27:20,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1587d1ca/3b51cb14eee34f9a90068d1e0345b0e0/FLAG151a69cad [2019-10-02 11:27:20,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1587d1ca/3b51cb14eee34f9a90068d1e0345b0e0 [2019-10-02 11:27:20,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:27:20,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:27:20,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:27:20,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:27:20,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:27:20,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:20,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba93b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20, skipping insertion in model container [2019-10-02 11:27:20,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:20,486 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:27:20,500 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:27:20,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:27:20,805 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:27:20,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:27:20,854 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:27:20,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20 WrapperNode [2019-10-02 11:27:20,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:27:20,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:27:20,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:27:20,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:27:21,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (1/1) ... [2019-10-02 11:27:21,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:27:21,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:27:21,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:27:21,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:27:21,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (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-10-02 11:27:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:27:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:27:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:27:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-10-02 11:27:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:27:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:27:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:27:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:27:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:27:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-10-02 11:27:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:27:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:27:21,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:27:21,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:27:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:27:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:27:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:27:21,376 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:27:21,376 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:27:21,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:27:21 BoogieIcfgContainer [2019-10-02 11:27:21,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:27:21,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:27:21,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:27:21,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:27:21,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:27:20" (1/3) ... [2019-10-02 11:27:21,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2c0b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:27:21, skipping insertion in model container [2019-10-02 11:27:21,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:20" (2/3) ... [2019-10-02 11:27:21,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2c0b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:27:21, skipping insertion in model container [2019-10-02 11:27:21,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:27:21" (3/3) ... [2019-10-02 11:27:21,386 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-10-02 11:27:21,402 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:27:21,415 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:27:21,448 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:27:21,489 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:27:21,490 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:27:21,490 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:27:21,490 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:27:21,490 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:27:21,491 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:27:21,491 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:27:21,491 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:27:21,491 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:27:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-02 11:27:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:27:21,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:21,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:21,519 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:21,525 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-10-02 11:27:21,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:21,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:21,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:27:21,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:27:21,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:27:21,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:27:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:27:21,769 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-02 11:27:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:21,787 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-10-02 11:27:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:27:21,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-02 11:27:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:21,795 INFO L225 Difference]: With dead ends: 45 [2019-10-02 11:27:21,796 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:27:21,799 INFO L640 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-10-02 11:27:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:27:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-02 11:27:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 11:27:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-02 11:27:21,836 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-10-02 11:27:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:21,837 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-02 11:27:21,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:27:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-02 11:27:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:27:21,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:21,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:21,839 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:21,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:21,839 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-10-02 11:27:21,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:21,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:21,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:21,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:27:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:27:21,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:27:21,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:27:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:27:21,990 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-10-02 11:27:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:22,051 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-02 11:27:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:27:22,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 11:27:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:22,052 INFO L225 Difference]: With dead ends: 30 [2019-10-02 11:27:22,052 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:27:22,053 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:27:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:27:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-02 11:27:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-02 11:27:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-02 11:27:22,058 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-10-02 11:27:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:22,059 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-02 11:27:22,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:27:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-02 11:27:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:27:22,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:22,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:22,060 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:22,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-10-02 11:27:22,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:22,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:22,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:22,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:22,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:27:22,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:27:22,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:27:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:27:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:27:22,268 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-02 11:27:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:22,339 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-10-02 11:27:22,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:27:22,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-02 11:27:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:22,341 INFO L225 Difference]: With dead ends: 34 [2019-10-02 11:27:22,341 INFO L226 Difference]: Without dead ends: 25 [2019-10-02 11:27:22,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:27:22,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-02 11:27:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-02 11:27:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-02 11:27:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-02 11:27:22,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-10-02 11:27:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:22,348 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-02 11:27:22,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:27:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-02 11:27:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:27:22,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:22,350 INFO L411 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] [2019-10-02 11:27:22,350 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-10-02 11:27:22,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:22,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:22,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:22,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:22,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:27:22,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:27:22,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:27:22,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:27:22,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:27:22,533 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-10-02 11:27:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:22,626 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-02 11:27:22,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:27:22,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-10-02 11:27:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:22,632 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:27:22,632 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 11:27:22,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:27:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 11:27:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-10-02 11:27:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 11:27:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-02 11:27:22,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-10-02 11:27:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:22,642 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-02 11:27:22,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:27:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-02 11:27:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:27:22,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:22,644 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:22,644 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:22,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2090216834, now seen corresponding path program 1 times [2019-10-02 11:27:22,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:22,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:22,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:22,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:27:22,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:27:22,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:27:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:27:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:27:22,750 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 4 states. [2019-10-02 11:27:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:22,808 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-02 11:27:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:27:22,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-10-02 11:27:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:22,810 INFO L225 Difference]: With dead ends: 48 [2019-10-02 11:27:22,810 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 11:27:22,811 INFO L640 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-10-02 11:27:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 11:27:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2019-10-02 11:27:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 11:27:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-10-02 11:27:22,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-10-02 11:27:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:22,818 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-10-02 11:27:22,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:27:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-10-02 11:27:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:27:22,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:22,819 INFO L411 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] [2019-10-02 11:27:22,820 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-10-02 11:27:22,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:22,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:22,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:22,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:22,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:27:22,936 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) [2019-10-02 11:27:22,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:27:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:23,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:27:23,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:27:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:27:23,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:27:23,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-10-02 11:27:23,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:27:23,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:27:23,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:27:23,183 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 10 states. [2019-10-02 11:27:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:23,580 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-10-02 11:27:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:27:23,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-02 11:27:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:23,582 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:27:23,583 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 11:27:23,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:27:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 11:27:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 11:27:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 11:27:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-10-02 11:27:23,598 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2019-10-02 11:27:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:23,598 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-10-02 11:27:23,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:27:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-10-02 11:27:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:27:23,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:23,602 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:23,602 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:23,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:23,603 INFO L82 PathProgramCache]: Analyzing trace with hash -648228970, now seen corresponding path program 1 times [2019-10-02 11:27:23,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:23,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:23,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:23,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:23,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:27:23,714 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-10-02 11:27:23,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:27:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:27:23,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:27:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:23,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:27:23,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 11:27:23,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:27:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:27:23,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:27:23,854 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2019-10-02 11:27:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:23,925 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-10-02 11:27:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:27:23,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-02 11:27:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:23,927 INFO L225 Difference]: With dead ends: 52 [2019-10-02 11:27:23,927 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:27:23,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:27:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:27:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-02 11:27:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:27:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-10-02 11:27:23,937 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2019-10-02 11:27:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:23,938 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-10-02 11:27:23,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:27:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-10-02 11:27:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:27:23,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:23,939 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:23,939 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:23,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:23,940 INFO L82 PathProgramCache]: Analyzing trace with hash -390063532, now seen corresponding path program 1 times [2019-10-02 11:27:23,940 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:23,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:23,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:26,413 WARN L191 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 163 DAG size of output: 31 [2019-10-02 11:27:28,828 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-10-02 11:27:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:28,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:27:28,836 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-10-02 11:27:28,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:28,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-02 11:27:28,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:27:28,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-10-02 11:27:28,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:27:28,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:27:29,000 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 44 treesize of output 1 [2019-10-02 11:27:29,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:27:29,045 INFO L567 ElimStorePlain]: treesize reduction 219, result has 10.6 percent of original size [2019-10-02 11:27:29,046 INFO L464 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2019-10-02 11:27:29,046 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-10-02 11:27:29,046 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-10-02 11:27:29,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:27:29,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-10-02 11:27:29,380 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-10-02 11:27:29,697 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-10-02 11:27:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:29,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:27:29,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-10-02 11:27:29,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:27:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:27:29,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:27:29,870 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2019-10-02 11:27:30,167 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-02 11:27:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:30,370 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-10-02 11:27:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:27:30,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-10-02 11:27:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:30,375 INFO L225 Difference]: With dead ends: 46 [2019-10-02 11:27:30,375 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 11:27:30,376 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:27:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 11:27:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-02 11:27:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 11:27:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-10-02 11:27:30,383 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 28 [2019-10-02 11:27:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:30,383 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-10-02 11:27:30,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:27:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-10-02 11:27:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:27:30,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:30,387 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:30,388 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash -723812178, now seen corresponding path program 2 times [2019-10-02 11:27:30,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:30,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:30,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:30,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:27:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:30,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:27:30,483 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-10-02 11:27:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:27:30,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:27:30,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:27:30,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:27:30,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:27:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:30,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:27:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 11:27:30,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:27:30,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:27:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:27:30,581 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 7 states. [2019-10-02 11:27:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:30,653 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-10-02 11:27:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:27:30,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-02 11:27:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:30,655 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:27:30,655 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 11:27:30,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:27:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 11:27:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2019-10-02 11:27:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-02 11:27:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-02 11:27:30,661 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-10-02 11:27:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:30,662 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-02 11:27:30,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:27:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-02 11:27:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:27:30,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:30,663 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:30,663 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -465646740, now seen corresponding path program 2 times [2019-10-02 11:27:30,664 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:30,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:30,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:30,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:27:30,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:31,771 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 35 [2019-10-02 11:27:32,169 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-10-02 11:27:32,502 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-02 11:27:32,933 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-10-02 11:27:33,362 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-10-02 11:28:27,525 WARN L191 SmtUtils]: Spent 45.27 s on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2019-10-02 11:28:41,039 WARN L191 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-10-02 11:28:42,983 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-02 11:28:49,847 WARN L191 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 300 DAG size of output: 38 [2019-10-02 11:28:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:49,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:49,858 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-10-02 11:28:49,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:28:49,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:28:49,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:49,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 11:28:49,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:49,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:58,719 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:28:58,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:58,782 INFO L567 ElimStorePlain]: treesize reduction 268, result has 12.7 percent of original size [2019-10-02 11:28:58,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-10-02 11:28:58,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:28:58,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:28:58,799 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-10-02 11:28:58,799 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-02 11:28:58,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:28:58,800 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-10-02 11:29:01,423 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 46 [2019-10-02 11:29:02,368 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 11:29:07,293 WARN L191 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-02 11:29:07,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:07,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:07,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:07,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:07,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:10,454 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-10-02 11:29:11,448 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-02 11:29:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:11,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-10-02 11:29:11,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 11:29:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 11:29:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=808, Unknown=7, NotChecked=0, Total=930 [2019-10-02 11:29:11,871 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 31 states. [2019-10-02 11:29:13,185 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-02 11:29:13,714 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 11:29:14,307 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-02 11:29:14,740 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 11:29:15,904 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 59 [2019-10-02 11:29:17,983 WARN L191 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 64 [2019-10-02 11:29:19,179 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 131 DAG size of output: 73 [2019-10-02 11:29:22,805 WARN L191 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-02 11:29:23,090 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 64 [2019-10-02 11:29:23,351 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-02 11:29:23,547 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-02 11:29:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:23,637 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-10-02 11:29:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:29:23,637 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-10-02 11:29:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:23,639 INFO L225 Difference]: With dead ends: 50 [2019-10-02 11:29:23,639 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:29:23,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 110.8s TimeCoverageRelationStatistics Valid=290, Invalid=1773, Unknown=7, NotChecked=0, Total=2070 [2019-10-02 11:29:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:29:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 11:29:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:29:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-10-02 11:29:23,647 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 32 [2019-10-02 11:29:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:23,648 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-10-02 11:29:23,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 11:29:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-10-02 11:29:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:29:23,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:23,649 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:23,649 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1595152954, now seen corresponding path program 3 times [2019-10-02 11:29:23,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:23,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:23,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:23,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:23,741 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-10-02 11:29:23,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:29:23,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 11:29:23,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:23,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 11:29:23,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:29:23,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:29:23,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 11:29:23,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:29:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:29:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:29:23,930 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2019-10-02 11:29:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:29:24,032 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-10-02 11:29:24,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:29:24,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-02 11:29:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:29:24,033 INFO L225 Difference]: With dead ends: 60 [2019-10-02 11:29:24,034 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:29:24,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:29:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:29:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2019-10-02 11:29:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 11:29:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-10-02 11:29:24,051 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2019-10-02 11:29:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:29:24,051 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-10-02 11:29:24,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:29:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-10-02 11:29:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 11:29:24,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:29:24,054 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:29:24,054 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:29:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:29:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1336987516, now seen corresponding path program 3 times [2019-10-02 11:29:24,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:29:24,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:29:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:24,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:29:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:29:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:29:24,527 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 32 [2019-10-02 11:29:25,031 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-10-02 11:29:25,360 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2019-10-02 11:29:25,600 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-02 11:29:31,398 WARN L191 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-02 11:29:33,461 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_linear_search_#in~n| c_linear_search_~n) (let ((.cse2 (div c_linear_search_~j~0 4294967296)) (.cse5 (div c_linear_search_~n 4294967296))) (let ((.cse3 (* (- 4294967296) .cse5)) (.cse6 (* 4294967296 .cse2))) (or (not (= |c_linear_search_#in~a.offset| 0)) (let ((.cse4 (div (+ c_linear_search_~j~0 (- 3)) 2))) (let ((.cse0 (+ (* 2 c_linear_search_~j~0) (* 8589934592 .cse5) (* 4 .cse4) 8)) (.cse1 (+ (* 34359738368 .cse2) (* 4 c_linear_search_~n) (* 17179869184 (div (+ (* (- 1) c_linear_search_~j~0) .cse3 c_linear_search_~n (* (- 2) .cse4)) 8589934592))))) (and (<= .cse0 .cse1) (or (< .cse0 .cse1) (not (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- (* (- 2) c_linear_search_~j~0)) (- (* 8589934592 .cse2)))) |c_linear_search_#in~q|)))))) (<= c_linear_search_~j~0 (+ (* 2 (div (+ .cse6 .cse3 c_linear_search_~n (- 4294967295)) 2)) 4)) (<= (+ c_linear_search_~j~0 (* 4294967296 .cse5) 4294967292) .cse6))))) is different from false [2019-10-02 11:29:33,717 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-02 11:29:34,110 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-02 11:29:36,324 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 125 DAG size of output: 45 [2019-10-02 11:29:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-10-02 11:29:36,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:29:36,335 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-10-02 11:29:36,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:29:36,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 11:29:36,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:29:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-02 11:29:36,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:29:36,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:29:51,207 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-10-02 11:29:51,233 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:29:51,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:51,318 INFO L567 ElimStorePlain]: treesize reduction 270, result has 12.6 percent of original size [2019-10-02 11:29:51,318 INFO L464 ElimStorePlain]: Eliminatee v_prenex_12 vanished before elimination [2019-10-02 11:29:51,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-10-02 11:29:51,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:29:51,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:29:51,337 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-10-02 11:29:51,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:29:51,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-10-02 11:29:52,001 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 11:29:54,228 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 45 [2019-10-02 11:29:54,553 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-02 11:29:56,365 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-02 11:29:57,702 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-02 11:30:01,188 WARN L191 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-02 11:30:02,411 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-02 11:30:05,929 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-10-02 11:30:05,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:05,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:05,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:05,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:07,587 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-10-02 11:30:07,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:10,897 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-10-02 11:30:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:30:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:30:11,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2019-10-02 11:30:11,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:30:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:30:11,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1008, Unknown=7, NotChecked=64, Total=1190 [2019-10-02 11:30:11,082 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 35 states. [2019-10-02 11:30:13,522 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-10-02 11:30:14,322 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-10-02 11:30:15,409 WARN L191 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-02 11:30:16,802 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 11:30:19,017 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 158 DAG size of output: 68 [2019-10-02 11:30:20,419 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 114 DAG size of output: 64 [2019-10-02 11:30:30,053 WARN L191 SmtUtils]: Spent 8.88 s on a formula simplification. DAG size of input: 145 DAG size of output: 84 [2019-10-02 11:30:38,175 WARN L191 SmtUtils]: Spent 7.79 s on a formula simplification. DAG size of input: 149 DAG size of output: 85 [2019-10-02 11:30:38,454 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2019-10-02 11:30:40,242 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 146 DAG size of output: 80 [2019-10-02 11:30:42,762 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 180 DAG size of output: 88 [2019-10-02 11:30:43,933 WARN L191 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 74 [2019-10-02 11:30:46,214 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse16 (div c_linear_search_~j~0 4294967296))) (let ((.cse1 (mod (+ c_linear_search_~j~0 4294967295) 4294967296)) (.cse2 (not (= |c_linear_search_#in~a.offset| 0))) (.cse5 (not (= (select .cse0 (+ (- (* (- 2) c_linear_search_~j~0)) (- (* 8589934592 .cse16)))) |c_linear_search_#in~q|))) (.cse6 (* 34359738368 .cse16)) (.cse8 (* (- 1) c_linear_search_~j~0)) (.cse10 (* 2 c_linear_search_~j~0)) (.cse11 (* 4294967296 .cse16))) (and (<= c_~MAX~0 100000) (not (= (select .cse0 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967292) 4294967296)))) |c_linear_search_#in~q|)) (exists ((|v_main_#t~nondet3_4| Int)) (= c_~SIZE~0 (+ (div (mod |v_main_#t~nondet3_4| 4294967296) 2) 1))) (= |c_linear_search_#in~n| c_linear_search_~n) (not (= (select .cse0 (+ (* 4 .cse1) |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (or .cse2 (<= (+ |c_linear_search_#in~n| 4294967292) 0) (let ((.cse9 (* (- 1) |c_linear_search_#in~n|))) (let ((.cse7 (div (+ .cse11 .cse9 (- 3)) 2))) (let ((.cse3 (+ (* 4 .cse7) .cse10 8)) (.cse4 (+ .cse6 (* 17179869184 (div (+ (* (- 2) .cse7) .cse8 .cse9) 8589934592))))) (and (<= .cse3 .cse4) (or .cse5 (< .cse3 .cse4)))))) |c_linear_search_#t~short1|) (not (= (select .cse0 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967293) 4294967296)))) |c_linear_search_#in~q|)) (< 1 (mod c_~SIZE~0 4294967296)) (not (= (select .cse0 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967294) 4294967296)))) |c_linear_search_#in~q|)) (= c_linear_search_~j~0 4) (< 0 (+ (div c_~MAX~0 4294967296) 1)) (< .cse1 (mod c_linear_search_~n 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_3 Int)) (= 3 (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_3) (* 4 (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296))))) (let ((.cse14 (div c_linear_search_~n 4294967296))) (or .cse2 (let ((.cse15 (div (+ c_linear_search_~j~0 (- 3)) 2))) (let ((.cse12 (+ .cse10 (* 8589934592 .cse14) (* 4 .cse15) 8)) (.cse13 (+ .cse6 (* 4 c_linear_search_~n) (* 17179869184 (div (+ .cse8 (* (- 4294967296) .cse14) c_linear_search_~n (* (- 2) .cse15)) 8589934592))))) (and (<= .cse12 .cse13) (or (< .cse12 .cse13) .cse5)))) (<= (+ c_linear_search_~j~0 (* 4294967296 .cse14) 4294967292) .cse11)))))) is different from false [2019-10-02 11:30:49,723 WARN L191 SmtUtils]: Spent 3.42 s on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-10-02 11:30:49,990 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 78 [2019-10-02 11:30:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:30:50,122 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-10-02 11:30:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:30:50,125 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-10-02 11:30:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:30:50,126 INFO L225 Difference]: With dead ends: 53 [2019-10-02 11:30:50,127 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 11:30:50,131 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 84.1s TimeCoverageRelationStatistics Valid=297, Invalid=2355, Unknown=8, NotChecked=202, Total=2862 [2019-10-02 11:30:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 11:30:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-02 11:30:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:30:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-10-02 11:30:50,148 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 36 [2019-10-02 11:30:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:30:50,149 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-10-02 11:30:50,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:30:50,149 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-10-02 11:30:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:30:50,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:30:50,149 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:30:50,150 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:30:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:30:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1972633310, now seen corresponding path program 4 times [2019-10-02 11:30:50,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:30:50,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:30:50,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:50,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:30:50,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:30:50,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:50,244 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-10-02 11:30:50,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:30:50,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:30:50,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:30:50,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:30:50,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:30:50,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:30:50,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 11:30:50,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:30:50,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:30:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:30:50,377 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 9 states. [2019-10-02 11:30:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:30:50,522 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-10-02 11:30:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:30:50,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-10-02 11:30:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:30:50,524 INFO L225 Difference]: With dead ends: 64 [2019-10-02 11:30:50,524 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 11:30:50,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:30:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 11:30:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-10-02 11:30:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 11:30:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-10-02 11:30:50,534 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2019-10-02 11:30:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:30:50,534 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-10-02 11:30:50,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:30:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-10-02 11:30:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:30:50,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:30:50,535 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:30:50,536 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:30:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:30:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2064168548, now seen corresponding path program 4 times [2019-10-02 11:30:50,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:30:50,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:30:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:50,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:30:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:50,987 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 31 [2019-10-02 11:30:51,597 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-10-02 11:30:56,671 WARN L191 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 184 DAG size of output: 50 [2019-10-02 11:30:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:30:56,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:56,682 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-10-02 11:30:56,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:30:56,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:30:56,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:30:56,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-02 11:30:56,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:56,879 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:30:56,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:02,950 WARN L191 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2019-10-02 11:31:02,950 INFO L567 ElimStorePlain]: treesize reduction 207, result has 12.7 percent of original size [2019-10-02 11:31:02,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-10-02 11:31:02,953 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:02,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:02,964 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2019-10-02 11:31:02,964 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-10-02 11:31:02,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:31:02,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-10-02 11:31:03,421 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-10-02 11:31:03,707 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-02 11:31:04,005 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 11:31:04,382 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-10-02 11:31:04,782 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-02 11:31:05,280 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-10-02 11:31:05,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:05,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:05,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:05,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:05,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:05,751 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-10-02 11:31:06,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:31:06,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:06,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 34 [2019-10-02 11:31:06,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 11:31:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 11:31:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1026, Unknown=1, NotChecked=0, Total=1122 [2019-10-02 11:31:06,369 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 34 states. [2019-10-02 11:31:09,418 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 11:31:09,641 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-02 11:31:10,548 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-10-02 11:31:10,858 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-02 11:31:11,412 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-10-02 11:31:11,842 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-10-02 11:31:12,042 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-10-02 11:31:12,612 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-02 11:31:13,029 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-10-02 11:31:13,257 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-10-02 11:31:13,545 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-10-02 11:31:13,997 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2019-10-02 11:31:14,579 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2019-10-02 11:31:14,960 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2019-10-02 11:31:15,406 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2019-10-02 11:31:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:15,502 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2019-10-02 11:31:15,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:31:15,502 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-10-02 11:31:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:15,503 INFO L225 Difference]: With dead ends: 58 [2019-10-02 11:31:15,504 INFO L226 Difference]: Without dead ends: 48 [2019-10-02 11:31:15,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=281, Invalid=2688, Unknown=1, NotChecked=0, Total=2970 [2019-10-02 11:31:15,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-02 11:31:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-10-02 11:31:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 11:31:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-10-02 11:31:15,515 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 40 [2019-10-02 11:31:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:15,516 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-10-02 11:31:15,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 11:31:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-10-02 11:31:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:31:15,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:15,521 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:31:15,521 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:15,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash 400149494, now seen corresponding path program 5 times [2019-10-02 11:31:15,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:15,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:15,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:15,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:15,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:31:15,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:15,632 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-10-02 11:31:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:31:16,100 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 11:31:16,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:31:16,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:31:16,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:31:16,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:31:16,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 11:31:16,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:31:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:31:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:31:16,149 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2019-10-02 11:31:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:16,331 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-10-02 11:31:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:31:16,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-02 11:31:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:16,334 INFO L225 Difference]: With dead ends: 68 [2019-10-02 11:31:16,334 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 11:31:16,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:31:16,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 11:31:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2019-10-02 11:31:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 11:31:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-10-02 11:31:16,341 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2019-10-02 11:31:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:16,341 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-10-02 11:31:16,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:31:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-10-02 11:31:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:31:16,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:16,342 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:31:16,343 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash 658314932, now seen corresponding path program 5 times [2019-10-02 11:31:16,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:16,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:31:16,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:35:35,917 WARN L191 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 215 DAG size of output: 37 [2019-10-02 11:35:36,311 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-10-02 11:35:36,581 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55 [2019-10-02 11:35:37,630 WARN L191 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-10-02 11:35:40,394 WARN L191 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-10-02 11:35:56,476 WARN L191 SmtUtils]: Spent 13.56 s on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-10-02 11:35:58,656 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_linear_search_~n 4294967296)) (.cse7 (div c_linear_search_~j~0 4294967296))) (let ((.cse8 (+ .cse7 1)) (.cse1 (* 4294967296 .cse2)) (.cse4 (* 4294967296 .cse7))) (and (let ((.cse0 (div (+ c_linear_search_~j~0 (- 4)) 2))) (or (<= (+ (* 3 .cse0) .cse1 (* 2147483648 (div (+ (* 3 c_linear_search_~j~0) (* 18446744065119617024 .cse2) (* (- 4294967294) c_linear_search_~n) 46116860167094009832) 18446744078004518912)) 4) c_linear_search_~n) (not (= |c_linear_search_#in~a.offset| 0)) (let ((.cse3 (* 2 c_linear_search_~j~0))) (let ((.cse5 (let ((.cse6 (* 4 .cse0))) (+ .cse6 (div (+ .cse6 (* (- 8589934592) c_linear_search_~j~0) (* (- 18446744090889420800) .cse7) (* 18446744090889420800 .cse2) (* (- 4294967300) c_linear_search_~n) (* (- 36893488156009037824) (div (+ (* (- 3) .cse0) (* (- 4294967296) .cse2) c_linear_search_~n (- 4)) 2147483648)) (* 8589934592 (div (+ .cse3 (* (- 4294967296) .cse7) .cse1 (* (- 1) c_linear_search_~n) (- 3)) 2)) 21474836492) 4294967297) 12)))) (and (<= (+ .cse3 .cse1) (+ .cse4 (* 2 (div (+ c_linear_search_~j~0 (- 5)) 2)) c_linear_search_~n 4)) (<= .cse5 0) (or (< .cse5 0) (not (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- (* (- 4) .cse0)) 12)))))))) (<= .cse8 0))) (= |c_linear_search_#in~n| c_linear_search_~n) (or (<= 0 .cse7) (< 0 .cse8)) (<= (+ .cse1 6) (+ .cse4 c_linear_search_~n)) (<= .cse4 c_linear_search_~j~0)))) is different from true [2019-10-02 11:36:15,380 WARN L191 SmtUtils]: Spent 12.46 s on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-10-02 11:36:32,966 WARN L191 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-10-02 11:36:54,841 WARN L191 SmtUtils]: Spent 8.53 s on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-10-02 11:37:01,150 WARN L191 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 219 DAG size of output: 72 [2019-10-02 11:37:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 71 refuted. 1 times theorem prover too weak. 0 trivial. 6 not checked. [2019-10-02 11:37:01,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:37:01,178 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-10-02 11:37:01,201 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:37:01,566 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 11:37:01,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:37:01,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 11:37:01,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:37:01,590 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:01,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:01,596 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:37:01,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:03,644 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-10-02 11:37:03,645 INFO L567 ElimStorePlain]: treesize reduction 170, result has 15.0 percent of original size [2019-10-02 11:37:03,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-10-02 11:37:03,648 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:37:03,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:37:03,657 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-10-02 11:37:03,657 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_10| vanished before elimination [2019-10-02 11:37:03,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 11:37:03,657 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:293, output treesize:26 [2019-10-02 11:37:13,775 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-02 11:37:15,755 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-10-02 11:37:18,570 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-10-02 11:37:19,902 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-02 11:37:23,456 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-02 11:37:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:37:26,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:37:26,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 37 [2019-10-02 11:37:26,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 11:37:26,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 11:37:26,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1131, Unknown=19, NotChecked=68, Total=1332 [2019-10-02 11:37:26,284 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 37 states. [2019-10-02 11:37:36,474 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-10-02 11:37:37,295 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2019-10-02 11:37:42,460 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 99 [2019-10-02 11:37:48,884 WARN L191 SmtUtils]: Spent 5.61 s on a formula simplification. DAG size of input: 142 DAG size of output: 113 [2019-10-02 11:37:56,411 WARN L191 SmtUtils]: Spent 6.28 s on a formula simplification. DAG size of input: 161 DAG size of output: 82 [2019-10-02 11:37:56,902 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-02 11:37:57,236 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 55 [2019-10-02 11:38:18,519 WARN L191 SmtUtils]: Spent 10.73 s on a formula simplification that was a NOOP. DAG size: 97 [2019-10-02 11:38:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:38:18,756 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2019-10-02 11:38:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:38:18,757 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 44 [2019-10-02 11:38:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:38:18,757 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:38:18,757 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 11:38:18,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 150.8s TimeCoverageRelationStatistics Valid=314, Invalid=2972, Unknown=24, NotChecked=112, Total=3422 [2019-10-02 11:38:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 11:38:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-02 11:38:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 11:38:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-10-02 11:38:18,765 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 44 [2019-10-02 11:38:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:38:18,766 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-10-02 11:38:18,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 11:38:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-10-02 11:38:18,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:38:18,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:38:18,767 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:38:18,767 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:38:18,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:38:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1505971470, now seen corresponding path program 6 times [2019-10-02 11:38:18,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:38:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:38:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:38:18,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:38:18,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:38:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:38:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:38:18,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:38:18,885 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-10-02 11:38:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:38:55,954 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 11:38:55,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:38:55,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:38:55,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:38:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:38:56,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:38:56,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 11:38:56,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:38:56,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:38:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:38:56,010 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 11 states. [2019-10-02 11:38:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:38:56,249 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-10-02 11:38:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:38:56,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-10-02 11:38:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:38:56,251 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:38:56,251 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:38:56,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:38:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:38:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-10-02 11:38:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 11:38:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-10-02 11:38:56,262 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 48 [2019-10-02 11:38:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:38:56,262 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-10-02 11:38:56,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:38:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-10-02 11:38:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 11:38:56,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:38:56,263 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:38:56,264 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:38:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:38:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1764136908, now seen corresponding path program 6 times [2019-10-02 11:38:56,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:38:56,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:38:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:38:56,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:38:56,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:38:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:38:56,781 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 36 [2019-10-02 11:38:57,116 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-10-02 11:38:58,792 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 11:39:03,417 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 185 DAG size of output: 51 [2019-10-02 11:39:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:39:03,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:39:03,435 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-10-02 11:39:03,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:39:49,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 11:39:49,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:39:49,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 81 conjunts are in the unsatisfiable core [2019-10-02 11:39:49,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:39:49,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:39:49,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2019-10-02 11:39:49,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:49,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2019-10-02 11:39:49,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:39:49,554 INFO L567 ElimStorePlain]: treesize reduction 359, result has 10.0 percent of original size [2019-10-02 11:39:49,554 INFO L464 ElimStorePlain]: Eliminatee v_prenex_20 vanished before elimination [2019-10-02 11:39:49,554 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_11| vanished before elimination [2019-10-02 11:39:49,555 INFO L464 ElimStorePlain]: Eliminatee v_prenex_22 vanished before elimination [2019-10-02 11:39:49,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:39:49,556 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:407, output treesize:40 [2019-10-02 11:39:51,515 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-02 11:39:54,426 WARN L191 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-10-02 11:39:54,959 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-02 11:39:56,050 WARN L191 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-10-02 11:40:00,266 WARN L191 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-02 11:40:01,326 WARN L191 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-10-02 11:40:04,345 WARN L191 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2019-10-02 11:40:04,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:40:04,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:40:04,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:40:04,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:40:04,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:40:06,896 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-10-02 11:40:12,424 WARN L191 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2019-10-02 11:40:13,818 WARN L191 SmtUtils]: Spent 913.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 11:40:21,640 WARN L191 SmtUtils]: Spent 6.69 s on a formula simplification. DAG size of input: 86 DAG size of output: 86 [2019-10-02 11:40:21,967 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 11:40:22,264 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-02 11:40:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:40:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:40:22,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27] total 43 [2019-10-02 11:40:22,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 11:40:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 11:40:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1662, Unknown=1, NotChecked=0, Total=1806 [2019-10-02 11:40:22,317 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 43 states. [2019-10-02 11:40:30,668 WARN L191 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-10-02 11:40:31,699 WARN L191 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-10-02 11:40:32,228 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-10-02 11:40:34,919 WARN L191 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-02 11:40:35,518 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-02 11:40:35,944 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-02 11:40:38,164 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-02 11:40:39,364 WARN L191 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2019-10-02 11:40:40,688 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-10-02 11:40:41,594 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-10-02 11:40:43,871 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-10-02 11:40:45,035 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-10-02 11:40:48,973 WARN L191 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 119 DAG size of output: 94 [2019-10-02 11:40:49,237 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-10-02 11:40:54,677 WARN L191 SmtUtils]: Spent 4.90 s on a formula simplification. DAG size of input: 145 DAG size of output: 106 [2019-10-02 11:40:54,965 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 97 [2019-10-02 11:40:55,227 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-10-02 11:41:01,078 WARN L191 SmtUtils]: Spent 5.71 s on a formula simplification. DAG size of input: 97 DAG size of output: 92 [2019-10-02 11:41:05,119 WARN L191 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-10-02 11:41:05,432 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-02 11:41:05,692 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-10-02 11:41:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:05,794 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-10-02 11:41:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 11:41:05,795 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 48 [2019-10-02 11:41:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:05,795 INFO L225 Difference]: With dead ends: 66 [2019-10-02 11:41:05,796 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 11:41:05,798 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 73.9s TimeCoverageRelationStatistics Valid=404, Invalid=4017, Unknown=1, NotChecked=0, Total=4422 [2019-10-02 11:41:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 11:41:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 11:41:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 11:41:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-10-02 11:41:05,806 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 48 [2019-10-02 11:41:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:05,806 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-10-02 11:41:05,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 11:41:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-10-02 11:41:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:41:05,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:05,807 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:05,807 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:05,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:05,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1705606618, now seen corresponding path program 7 times [2019-10-02 11:41:05,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:05,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:41:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:05,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:41:05,946 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-10-02 11:41:05,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:06,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-02 11:41:06,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:41:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:06,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:41:06,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 11:41:06,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:41:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:41:06,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:41:06,044 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2019-10-02 11:41:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:06,336 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-10-02 11:41:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:41:06,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-10-02 11:41:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:06,337 INFO L225 Difference]: With dead ends: 76 [2019-10-02 11:41:06,337 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 11:41:06,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:41:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 11:41:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-10-02 11:41:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-02 11:41:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-10-02 11:41:06,345 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2019-10-02 11:41:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:06,345 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-10-02 11:41:06,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:41:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-10-02 11:41:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-02 11:41:06,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:06,346 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:06,346 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:06,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1447441180, now seen corresponding path program 7 times [2019-10-02 11:41:06,347 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:06,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:06,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:06,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:08,843 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 179 DAG size of output: 34 [2019-10-02 11:41:09,102 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-10-02 11:41:09,942 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-10-02 11:41:10,436 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 55 [2019-10-02 11:41:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:41:10,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:41:10,454 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-10-02 11:41:10,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:10,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-02 11:41:10,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:41:10,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:31,133 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2019-10-02 11:41:31,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2019-10-02 11:41:31,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:41:31,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:41:31,154 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 58 treesize of output 1 [2019-10-02 11:41:31,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:41:31,254 INFO L567 ElimStorePlain]: treesize reduction 280, result has 11.1 percent of original size [2019-10-02 11:41:31,254 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_12| vanished before elimination [2019-10-02 11:41:31,255 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-10-02 11:41:31,255 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-10-02 11:41:31,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 11:41:31,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-10-02 11:41:32,371 WARN L191 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 11:41:34,641 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-02 11:41:36,102 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-02 11:41:38,854 WARN L191 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-02 11:41:39,381 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-02 11:41:40,572 WARN L191 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-02 11:41:41,245 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 63