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_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:12,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:12,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:12,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:12,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:12,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:12,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:12,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:12,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:12,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:12,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:12,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:12,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:12,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:12,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:12,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:12,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:12,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:12,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:12,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:12,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:12,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:12,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:12,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:12,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:12,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:12,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:12,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:12,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:12,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:12,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:12,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:12,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:12,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:12,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:12,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:12,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:12,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:12,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:12,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:12,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:12,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:29:12,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:12,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:12,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:12,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:12,384 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:12,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:12,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:12,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:12,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:12,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:12,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:12,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:12,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:12,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:12,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:12,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:12,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:12,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:12,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:12,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:12,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:12,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:12,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:12,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:12,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:12,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:12,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:12,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:12,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:12,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:12,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:12,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:12,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:12,463 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:12,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch.c [2019-09-05 11:29:12,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbff0905/81bb2dd1835a4cfd9d34cfe831ae079c/FLAG26e5b7ef4 [2019-09-05 11:29:13,015 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:13,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2019-09-05 11:29:13,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbff0905/81bb2dd1835a4cfd9d34cfe831ae079c/FLAG26e5b7ef4 [2019-09-05 11:29:13,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbff0905/81bb2dd1835a4cfd9d34cfe831ae079c [2019-09-05 11:29:13,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:13,441 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:13,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:13,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:13,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:13,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afa15e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13, skipping insertion in model container [2019-09-05 11:29:13,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,457 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:13,474 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:13,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:13,709 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:13,738 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:13,868 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:13,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13 WrapperNode [2019-09-05 11:29:13,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:13,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:13,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:13,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:13,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... [2019-09-05 11:29:13,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:13,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:13,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:13,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:13,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-09-05 11:29:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-05 11:29:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:14,274 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:14,274 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:29:14,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:14 BoogieIcfgContainer [2019-09-05 11:29:14,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:14,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:14,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:14,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:14,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:13" (1/3) ... [2019-09-05 11:29:14,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e50837a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:14, skipping insertion in model container [2019-09-05 11:29:14,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:13" (2/3) ... [2019-09-05 11:29:14,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e50837a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:14, skipping insertion in model container [2019-09-05 11:29:14,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:14" (3/3) ... [2019-09-05 11:29:14,284 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2019-09-05 11:29:14,294 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:14,302 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:14,336 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:14,359 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:14,360 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:14,360 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:14,360 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:14,360 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:14,360 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:14,361 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:14,361 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:14,361 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-05 11:29:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:29:14,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:14,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:14,385 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1860043698, now seen corresponding path program 1 times [2019-09-05 11:29:14,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:14,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:14,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:14,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:29:14,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:29:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:29:14,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:14,572 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-05 11:29:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:14,590 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-05 11:29:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:29:14,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-05 11:29:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:14,598 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:29:14,598 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:29:14,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:29:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 11:29:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:29:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-05 11:29:14,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2019-09-05 11:29:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:14,633 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-05 11:29:14,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:29:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-05 11:29:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:14,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:14,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:14,634 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash 916881159, now seen corresponding path program 1 times [2019-09-05 11:29:14,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:14,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:14,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:29:14,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:29:14,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:29:14,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:14,813 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-09-05 11:29:14,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:14,872 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-05 11:29:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:14,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-05 11:29:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:14,874 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:29:14,874 INFO L226 Difference]: Without dead ends: 21 [2019-09-05 11:29:14,876 INFO L628 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-09-05 11:29:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-05 11:29:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-05 11:29:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:29:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-05 11:29:14,881 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2019-09-05 11:29:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:14,882 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-05 11:29:14,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:29:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-05 11:29:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:14,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:14,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:14,884 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:14,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:14,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1635275802, now seen corresponding path program 1 times [2019-09-05 11:29:14,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:14,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:15,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:29:15,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:29:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:29:15,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:15,074 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-09-05 11:29:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:15,162 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-09-05 11:29:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:15,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-05 11:29:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:15,164 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:29:15,164 INFO L226 Difference]: Without dead ends: 24 [2019-09-05 11:29:15,165 INFO L628 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-09-05 11:29:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-05 11:29:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-09-05 11:29:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-05 11:29:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-05 11:29:15,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-09-05 11:29:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:15,178 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-05 11:29:15,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:29:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-05 11:29:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-05 11:29:15,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:15,180 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:15,180 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash 636491705, now seen corresponding path program 1 times [2019-09-05 11:29:15,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:15,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:15,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:15,461 INFO L223 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-09-05 11:29:15,477 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-09-05 11:29:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:15,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:15,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:15,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-05 11:29:15,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:29:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:29:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:29:15,703 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 11 states. [2019-09-05 11:29:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:16,368 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-05 11:29:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:29:16,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-09-05 11:29:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:16,371 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:29:16,371 INFO L226 Difference]: Without dead ends: 30 [2019-09-05 11:29:16,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-09-05 11:29:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-05 11:29:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-09-05 11:29:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:29:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-05 11:29:16,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2019-09-05 11:29:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:16,380 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-05 11:29:16,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:29:16,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-05 11:29:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-05 11:29:16,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:16,381 INFO L399 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] [2019-09-05 11:29:16,381 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:16,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1625384636, now seen corresponding path program 1 times [2019-09-05 11:29:16,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:16,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:16,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:16,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,984 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 39 [2019-09-05 11:29:17,732 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2019-09-05 11:29:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:17,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,740 INFO L223 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:17,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:29:17,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:23,810 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-09-05 11:29:23,881 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 56 treesize of output 52 [2019-09-05 11:29:23,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,894 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 55 treesize of output 1 [2019-09-05 11:29:23,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:24,020 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-09-05 11:29:24,021 INFO L567 ElimStorePlain]: treesize reduction 268, result has 10.7 percent of original size [2019-09-05 11:29:24,022 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-09-05 11:29:24,022 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-09-05 11:29:24,023 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-09-05 11:29:24,023 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-09-05 11:29:24,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:359, output treesize:32 [2019-09-05 11:29:26,130 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-05 11:29:26,614 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-09-05 11:29:26,777 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-09-05 11:29:28,746 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-05 11:29:28,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:28,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:28,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:28,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:30,458 WARN L188 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-05 11:29:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:31,280 WARN L188 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-09-05 11:29:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:31,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:31,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-05 11:29:31,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-05 11:29:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-05 11:29:31,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=396, Unknown=3, NotChecked=0, Total=462 [2019-09-05 11:29:31,405 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 22 states. [2019-09-05 11:29:32,045 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-05 11:29:34,269 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-09-05 11:29:34,761 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-05 11:29:43,198 WARN L188 SmtUtils]: Spent 8.35 s on a formula simplification. DAG size of input: 100 DAG size of output: 62 [2019-09-05 11:29:45,740 WARN L188 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 125 DAG size of output: 88 [2019-09-05 11:29:49,193 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-09-05 11:29:50,161 WARN L188 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-05 11:29:52,975 WARN L188 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-09-05 11:29:53,895 WARN L188 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-09-05 11:29:56,185 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-09-05 11:29:56,433 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-09-05 11:29:56,883 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-05 11:29:57,117 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-05 11:29:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:57,606 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-09-05 11:29:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:29:57,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-09-05 11:29:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:57,610 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:29:57,611 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:29:57,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=273, Invalid=1284, Unknown=3, NotChecked=0, Total=1560 [2019-09-05 11:29:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:29:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 11:29:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:29:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-09-05 11:29:57,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2019-09-05 11:29:57,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:57,618 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-09-05 11:29:57,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-05 11:29:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-09-05 11:29:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-05 11:29:57,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:57,619 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:57,620 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -854746409, now seen corresponding path program 2 times [2019-09-05 11:29:57,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:57,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:57,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:58,208 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 36 [2019-09-05 11:29:58,619 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-09-05 11:29:59,372 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 37 [2019-09-05 11:29:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:59,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:59,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:59,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:59,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:59,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:59,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:29:59,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:05,728 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:30:05,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:07,794 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 26 [2019-09-05 11:30:07,795 INFO L567 ElimStorePlain]: treesize reduction 238, result has 11.5 percent of original size [2019-09-05 11:30:07,795 INFO L464 ElimStorePlain]: Eliminatee v_prenex_9 vanished before elimination [2019-09-05 11:30:07,799 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-09-05 11:30:07,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:07,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:07,810 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-09-05 11:30:07,812 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-09-05 11:30:07,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:329, output treesize:27 [2019-09-05 11:30:10,655 WARN L188 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-05 11:30:15,188 WARN L188 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-05 11:30:22,030 WARN L188 SmtUtils]: Spent 4.65 s on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-09-05 11:30:22,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:22,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:22,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:22,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:22,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:22,977 WARN L188 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-05 11:30:24,542 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-09-05 11:30:24,986 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-09-05 11:30:29,648 WARN L188 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-09-05 11:30:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:29,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:29,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2019-09-05 11:30:29,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:30:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:30:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=752, Unknown=4, NotChecked=0, Total=870 [2019-09-05 11:30:29,924 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-09-05 11:30:32,217 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2019-09-05 11:30:34,965 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-05 11:30:39,994 WARN L188 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2019-09-05 11:30:41,557 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 125 DAG size of output: 53 [2019-09-05 11:30:45,926 WARN L188 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-05 11:30:46,260 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 70 [2019-09-05 11:30:47,110 WARN L188 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2019-09-05 11:30:52,752 WARN L188 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-09-05 11:30:53,566 WARN L188 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-09-05 11:30:58,993 WARN L188 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-05 11:30:59,875 WARN L188 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-09-05 11:31:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:02,242 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-09-05 11:31:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:31:02,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-09-05 11:31:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:02,245 INFO L225 Difference]: With dead ends: 64 [2019-09-05 11:31:02,245 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:31:02,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=344, Invalid=2102, Unknown=4, NotChecked=0, Total=2450 [2019-09-05 11:31:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:31:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-05 11:31:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:31:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-05 11:31:02,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2019-09-05 11:31:02,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:02,255 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-05 11:31:02,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:31:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-05 11:31:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:31:02,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:02,256 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:02,256 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash 628477028, now seen corresponding path program 3 times [2019-09-05 11:31:02,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:02,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:02,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:04,712 WARN L188 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 225 DAG size of output: 36 [2019-09-05 11:31:05,181 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 43 [2019-09-05 11:31:05,312 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-09-05 11:31:05,456 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-05 11:31:06,175 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 46 [2019-09-05 11:31:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:06,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:31:06,184 INFO L223 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) [2019-09-05 11:31:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:31:09,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 11:31:09,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:31:09,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-05 11:31:09,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:31:09,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:09,852 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:09,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:09,863 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:31:09,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:15,952 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 61 DAG size of output: 31 [2019-09-05 11:31:15,953 INFO L567 ElimStorePlain]: treesize reduction 232, result has 15.9 percent of original size [2019-09-05 11:31:15,956 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-09-05 11:31:15,956 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-05 11:31:15,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:31:15,971 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-09-05 11:31:15,971 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-09-05 11:31:15,972 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-09-05 11:31:15,972 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:407, output treesize:40 [2019-09-05 11:31:16,500 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-05 11:31:17,015 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-09-05 11:31:19,419 WARN L188 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-05 11:31:20,047 WARN L188 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-09-05 11:31:20,620 WARN L188 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-05 11:31:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:20,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:20,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:20,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:20,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:31:23,526 WARN L188 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-05 11:31:23,928 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-05 11:31:25,401 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-09-05 11:31:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:31:25,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:31:25,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-05 11:31:25,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-05 11:31:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-05 11:31:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-09-05 11:31:25,770 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 32 states. [2019-09-05 11:31:28,022 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-05 11:31:30,133 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-09-05 11:31:34,499 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-05 11:31:34,807 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-05 11:31:35,138 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-05 11:31:35,358 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-05 11:31:36,512 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-09-05 11:31:36,881 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 70 [2019-09-05 11:31:38,702 WARN L188 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-05 11:31:39,603 WARN L188 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-05 11:31:39,949 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-05 11:31:40,657 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-05 11:31:40,982 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2019-09-05 11:31:41,306 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 72 [2019-09-05 11:31:42,061 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 70 [2019-09-05 11:31:42,764 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-09-05 11:31:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:31:42,878 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-09-05 11:31:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-05 11:31:42,879 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-09-05 11:31:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:31:42,880 INFO L225 Difference]: With dead ends: 54 [2019-09-05 11:31:42,880 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 11:31:42,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=283, Invalid=2069, Unknown=0, NotChecked=0, Total=2352 [2019-09-05 11:31:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 11:31:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-09-05 11:31:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-05 11:31:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-09-05 11:31:42,888 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 32 [2019-09-05 11:31:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:31:42,889 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-09-05 11:31:42,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-05 11:31:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-09-05 11:31:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:31:42,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:31:42,890 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:31:42,891 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:31:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:31:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash 714347447, now seen corresponding path program 4 times [2019-09-05 11:31:42,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:31:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:31:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:42,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:31:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:31:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:31:43,021 ERROR L253 erpolLogProxyWrapper]: Interpolant 17 not inductive: (Check returned sat) [2019-09-05 11:31:43,083 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-05 11:31:43,088 INFO L168 Benchmark]: Toolchain (without parser) took 149646.75 ms. Allocated memory was 138.4 MB in the beginning and 328.7 MB in the end (delta: 190.3 MB). Free memory was 85.6 MB in the beginning and 267.8 MB in the end (delta: -182.2 MB). Peak memory consumption was 218.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:31:43,088 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:31:43,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.96 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 85.4 MB in the beginning and 177.2 MB in the end (delta: -91.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:31:43,090 INFO L168 Benchmark]: Boogie Preprocessor took 62.42 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 175.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:31:43,091 INFO L168 Benchmark]: RCFGBuilder took 343.10 ms. Allocated memory is still 199.8 MB. Free memory was 175.0 MB in the beginning and 160.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:31:43,091 INFO L168 Benchmark]: TraceAbstraction took 148809.84 ms. Allocated memory was 199.8 MB in the beginning and 328.7 MB in the end (delta: 129.0 MB). Free memory was 159.6 MB in the beginning and 267.8 MB in the end (delta: -108.2 MB). Peak memory consumption was 231.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:31:43,103 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 138.4 MB. Free memory was 104.4 MB in the beginning and 104.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 426.96 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 85.4 MB in the beginning and 177.2 MB in the end (delta: -91.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.42 ms. Allocated memory is still 199.8 MB. Free memory was 177.2 MB in the beginning and 175.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 343.10 ms. Allocated memory is still 199.8 MB. Free memory was 175.0 MB in the beginning and 160.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148809.84 ms. Allocated memory was 199.8 MB in the beginning and 328.7 MB in the end (delta: 129.0 MB). Free memory was 159.6 MB in the beginning and 267.8 MB in the end (delta: -108.2 MB). Peak memory consumption was 231.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...