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-673a906-m [2019-10-02 11:24:48,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:24:48,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:24:48,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:24:48,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:24:48,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:24:48,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:24:48,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:24:48,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:24:48,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:24:48,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:24:48,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:24:48,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:24:48,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:24:48,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:24:48,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:24:48,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:24:48,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:24:48,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:24:48,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:24:48,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:24:48,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:24:48,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:24:48,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:24:48,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:24:48,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:24:48,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:24:48,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:24:48,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:24:48,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:24:48,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:24:48,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:24:48,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:24:48,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:24:48,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:24:48,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:24:48,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:24:48,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:24:48,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:24:48,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:24:48,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:24:48,300 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:24:48,323 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:24:48,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:24:48,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:24:48,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:24:48,326 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:24:48,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:24:48,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:24:48,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:24:48,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:24:48,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:24:48,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:24:48,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:24:48,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:24:48,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:24:48,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:24:48,330 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:24:48,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:24:48,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:24:48,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:24:48,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:24:48,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:24:48,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:24:48,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:24:48,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:24:48,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:24:48,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:24:48,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:24:48,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:24:48,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:24:48,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:24:48,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:24:48,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:24:48,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:24:48,386 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:24:48,388 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-10-02 11:24:48,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35968281/2a798615caf448b19926cfeb2cec6bb6/FLAG41f452450 [2019-10-02 11:24:48,971 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:24:48,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2019-10-02 11:24:48,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35968281/2a798615caf448b19926cfeb2cec6bb6/FLAG41f452450 [2019-10-02 11:24:49,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35968281/2a798615caf448b19926cfeb2cec6bb6 [2019-10-02 11:24:49,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:24:49,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:24:49,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:24:49,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:24:49,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:24:49,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ea211b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49, skipping insertion in model container [2019-10-02 11:24:49,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,330 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:24:49,349 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:24:49,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:24:49,583 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:24:49,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:24:49,617 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:24:49,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49 WrapperNode [2019-10-02 11:24:49,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:24:49,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:24:49,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:24:49,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:24:49,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (1/1) ... [2019-10-02 11:24:49,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:24:49,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:24:49,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:24:49,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:24:49,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (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:24:49,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:24:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:24:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:24:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-10-02 11:24:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:24:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:24:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:24:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:24:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:24:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-10-02 11:24:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:24:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:24:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:24:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:24:49,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:24:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:24:49,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:24:50,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:24:50,068 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:24:50,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:24:50 BoogieIcfgContainer [2019-10-02 11:24:50,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:24:50,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:24:50,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:24:50,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:24:50,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:24:49" (1/3) ... [2019-10-02 11:24:50,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dc097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:24:50, skipping insertion in model container [2019-10-02 11:24:50,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:24:49" (2/3) ... [2019-10-02 11:24:50,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dc097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:24:50, skipping insertion in model container [2019-10-02 11:24:50,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:24:50" (3/3) ... [2019-10-02 11:24:50,078 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2019-10-02 11:24:50,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:24:50,097 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:24:50,115 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:24:50,161 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:24:50,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:24:50,162 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:24:50,162 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:24:50,163 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:24:50,163 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:24:50,163 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:24:50,163 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:24:50,163 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:24:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-02 11:24:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 11:24:50,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:50,187 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:24:50,189 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1860043698, now seen corresponding path program 1 times [2019-10-02 11:24:50,196 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:50,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:50,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:50,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:50,397 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:24:50,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:24:50,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:24:50,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:24:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:24:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:24:50,419 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-02 11:24:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:50,438 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-10-02 11:24:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:24:50,440 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-02 11:24:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:50,447 INFO L225 Difference]: With dead ends: 44 [2019-10-02 11:24:50,447 INFO L226 Difference]: Without dead ends: 21 [2019-10-02 11:24:50,450 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:24:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-02 11:24:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-02 11:24:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:24:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-02 11:24:50,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2019-10-02 11:24:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:50,491 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-02 11:24:50,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:24:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-02 11:24:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:24:50,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:50,492 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:24:50,493 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash 916881159, now seen corresponding path program 1 times [2019-10-02 11:24:50,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:50,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:50,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:50,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:50,651 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:24:50,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:24:50,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:24:50,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:24:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:24:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:24:50,657 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2019-10-02 11:24:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:50,713 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-10-02 11:24:50,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:24:50,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-02 11:24:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:50,715 INFO L225 Difference]: With dead ends: 29 [2019-10-02 11:24:50,715 INFO L226 Difference]: Without dead ends: 21 [2019-10-02 11:24:50,716 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:24:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-02 11:24:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-02 11:24:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:24:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-02 11:24:50,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2019-10-02 11:24:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:50,722 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-02 11:24:50,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:24:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-02 11:24:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:24:50,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:50,724 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:24:50,724 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1635275802, now seen corresponding path program 1 times [2019-10-02 11:24:50,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:50,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:50,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:50,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:50,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:50,938 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:24:50,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:24:50,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:24:50,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:24:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:24:50,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:24:50,943 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-10-02 11:24:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:51,032 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-02 11:24:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:24:51,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-02 11:24:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:51,036 INFO L225 Difference]: With dead ends: 33 [2019-10-02 11:24:51,036 INFO L226 Difference]: Without dead ends: 24 [2019-10-02 11:24:51,037 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:24:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-02 11:24:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-02 11:24:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-02 11:24:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-02 11:24:51,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-10-02 11:24:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:51,051 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-02 11:24:51,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:24:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-02 11:24:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:24:51,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:51,054 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] [2019-10-02 11:24:51,054 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 636491705, now seen corresponding path program 1 times [2019-10-02 11:24:51,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:51,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:51,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:51,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:51,271 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:24:51,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:51,271 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:24:51,309 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:24:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:51,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:24:51,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:24:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-10-02 11:24:51,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:24:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:24:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:24:51,501 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2019-10-02 11:24:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:51,624 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-10-02 11:24:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:24:51,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-10-02 11:24:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:51,626 INFO L225 Difference]: With dead ends: 36 [2019-10-02 11:24:51,626 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 11:24:51,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:24:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 11:24:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 11:24:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:24:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-02 11:24:51,633 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2019-10-02 11:24:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:51,634 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-02 11:24:51,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:24:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-02 11:24:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:24:51,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:51,635 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:24:51,636 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1232357626, now seen corresponding path program 2 times [2019-10-02 11:24:51,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:51,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:51,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:51,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:24:51,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:51,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:24:51,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:24:51,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 11:24:51,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:24:51,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:24:51,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:24:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:24:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-10-02 11:24:52,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:24:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:24:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:24:52,084 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 11 states. [2019-10-02 11:24:52,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:24:52,292 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-02 11:24:52,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:24:52,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-10-02 11:24:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:24:52,296 INFO L225 Difference]: With dead ends: 39 [2019-10-02 11:24:52,297 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 11:24:52,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:24:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 11:24:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-10-02 11:24:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:24:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-02 11:24:52,305 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 26 [2019-10-02 11:24:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:24:52,306 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-02 11:24:52,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:24:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-02 11:24:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:24:52,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:24:52,307 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] [2019-10-02 11:24:52,308 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:24:52,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:24:52,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1625384636, now seen corresponding path program 1 times [2019-10-02 11:24:52,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:24:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:24:52,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:52,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:24:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:24:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:54,773 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 163 DAG size of output: 31 [2019-10-02 11:24:57,197 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-10-02 11:24:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:24:57,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:24:57,203 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:24:57,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:24:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:24:57,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 11:24:57,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:24:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:01,385 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-10-02 11:25:01,449 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-10-02 11:25:01,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:01,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 11:25:01,480 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-10-02 11:25:01,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:01,610 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-10-02 11:25:01,611 INFO L567 ElimStorePlain]: treesize reduction 268, result has 10.7 percent of original size [2019-10-02 11:25:01,611 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-10-02 11:25:01,611 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-10-02 11:25:01,612 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-10-02 11:25:01,613 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:25:01,613 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:359, output treesize:32 [2019-10-02 11:25:02,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:02,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:05,072 WARN L191 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-10-02 11:25:05,597 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-10-02 11:25:05,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:07,599 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2019-10-02 11:25:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:25:07,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:25:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2019-10-02 11:25:07,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:25:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:25:07,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=239, Unknown=2, NotChecked=0, Total=306 [2019-10-02 11:25:07,735 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 18 states. [2019-10-02 11:25:08,444 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-02 11:25:10,758 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-10-02 11:25:11,979 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-10-02 11:25:12,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:25:12,084 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-10-02 11:25:12,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:25:12,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-02 11:25:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:25:12,088 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:25:12,088 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 11:25:12,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=120, Invalid=430, Unknown=2, NotChecked=0, Total=552 [2019-10-02 11:25:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 11:25:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-10-02 11:25:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 11:25:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-02 11:25:12,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 26 [2019-10-02 11:25:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:25:12,104 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-02 11:25:12,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:25:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-02 11:25:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 11:25:12,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:25:12,105 INFO L411 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-10-02 11:25:12,106 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:25:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:25:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash -854746409, now seen corresponding path program 2 times [2019-10-02 11:25:12,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:25:12,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:25:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:25:12,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:25:12,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:25:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:25:14,548 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 165 DAG size of output: 32 [2019-10-02 11:25:14,796 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2019-10-02 11:25:21,350 WARN L191 SmtUtils]: Spent 6.29 s on a formula simplification. DAG size of input: 175 DAG size of output: 39 [2019-10-02 11:25:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:25:21,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:25:21,356 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:25:21,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:25:21,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:25:21,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:25:21,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-02 11:25:21,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:25:21,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:24,121 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:25:24,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:24,174 INFO L567 ElimStorePlain]: treesize reduction 238, result has 11.5 percent of original size [2019-10-02 11:25:24,174 INFO L464 ElimStorePlain]: Eliminatee v_prenex_9 vanished before elimination [2019-10-02 11:25:24,179 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:25:24,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:25:24,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:25:24,186 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-02 11:25:24,187 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:25:24,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:329, output treesize:27 [2019-10-02 11:25:24,625 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-10-02 11:25:26,353 WARN L191 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 11:25:32,864 WARN L191 SmtUtils]: Spent 6.41 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-02 11:25:35,261 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-02 11:25:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:35,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:35,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:35,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:25:37,087 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-02 11:25:40,048 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-10-02 11:25:41,148 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 11:25:45,162 WARN L191 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-02 11:25:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:25:45,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:25:45,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 26 [2019-10-02 11:25:45,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 11:25:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 11:25:45,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=539, Unknown=1, NotChecked=0, Total=650 [2019-10-02 11:25:45,389 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 26 states. [2019-10-02 11:25:46,043 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-10-02 11:25:46,587 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2019-10-02 11:25:47,435 WARN L191 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-10-02 11:25:47,711 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-10-02 11:25:53,799 WARN L191 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-10-02 11:25:54,644 WARN L191 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-02 11:26:00,900 WARN L191 SmtUtils]: Spent 5.84 s on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-10-02 11:26:02,928 WARN L191 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-10-02 11:26:05,524 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-02 11:26:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:26:05,641 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2019-10-02 11:26:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 11:26:05,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-10-02 11:26:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:26:05,643 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:26:05,643 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 11:26:05,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=263, Invalid=1376, Unknown=1, NotChecked=0, Total=1640 [2019-10-02 11:26:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 11:26:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-10-02 11:26:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:26:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-02 11:26:05,653 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 [2019-10-02 11:26:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:26:05,654 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-02 11:26:05,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 11:26:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-02 11:26:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:26:05,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:26:05,655 INFO L411 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-10-02 11:26:05,656 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:26:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:26:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 628477028, now seen corresponding path program 3 times [2019-10-02 11:26:05,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:26:05,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:26:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:05,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:26:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:26:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:26:06,090 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 31 [2019-10-02 11:26:06,430 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-10-02 11:26:06,661 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 42 [2019-10-02 11:26:06,879 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 61 [2019-10-02 11:26:07,078 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2019-10-02 11:26:07,300 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2019-10-02 11:26:07,813 WARN L191 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2019-10-02 11:26:10,067 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-10-02 11:26:10,311 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 53 [2019-10-02 11:26:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:26:10,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:26:10,320 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:26:10,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:26:13,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 11:26:13,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:26:13,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-02 11:26:13,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:26:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:26:15,965 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:26:15,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:26:15,973 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:26:15,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:26:16,039 INFO L567 ElimStorePlain]: treesize reduction 232, result has 15.9 percent of original size [2019-10-02 11:26:16,043 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:26:16,044 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:26:16,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:26:16,058 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-10-02 11:26:16,058 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-10-02 11:26:16,058 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:26:16,059 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:407, output treesize:40 [2019-10-02 11:26:16,689 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 11:26:20,781 WARN L191 SmtUtils]: Spent 3.89 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-02 11:26:22,349 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-02 11:26:22,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:26:22,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:26:22,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:26:22,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:26:22,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:26:23,255 WARN L191 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-02 11:26:25,374 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 11:26:26,366 WARN L191 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-02 11:26:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:26:26,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:26:26,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2019-10-02 11:26:26,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 11:26:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 11:26:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:26:26,671 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 31 states. [2019-10-02 11:26:34,712 WARN L191 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-10-02 11:26:35,651 WARN L191 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-10-02 11:26:37,948 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 11:26:38,244 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-10-02 11:26:38,891 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-02 11:26:39,388 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-10-02 11:26:41,661 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-10-02 11:26:41,936 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2019-10-02 11:26:42,283 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-10-02 11:26:42,947 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-10-02 11:26:44,768 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 169 DAG size of output: 122 [2019-10-02 11:26:45,151 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2019-10-02 11:26:45,589 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-10-02 11:26:45,913 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-10-02 11:26:47,964 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (div (+ (* (- 4) c_linear_search_~j~0) (- 4)) 2)) (.cse8 (div c_linear_search_~n 4294967296)) (.cse7 (div c_linear_search_~j~0 4294967296)) (.cse12 (= c_linear_search_~a.offset 0))) (let ((.cse9 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse11 (mod c_~SIZE~0 4294967296)) (.cse10 (mod (+ c_linear_search_~j~0 4294967295) 4294967296)) (.cse0 (not .cse12)) (.cse1 (<= c_linear_search_~j~0 3)) (.cse2 (<= (+ .cse8 1) .cse7)) (.cse3 (and (not (= (select (select |c_#memory_int| c_linear_search_~a.base) (+ (* (- 1) .cse6) c_linear_search_~a.offset)) |c_linear_search_#in~q|)) (= |c_linear_search_#in~a.base| c_linear_search_~a.base)))) (and (or .cse0 (and .cse1 (or .cse2 (not |c_linear_search_#t~short1|) (let ((.cse4 (+ (* 4 (div (+ (* 2 c_linear_search_~j~0) (* (- 4294967296) .cse7) (* 4294967296 .cse8) (* (- 1) c_linear_search_~n) (- 1)) 2)) 4)) (.cse5 (+ (* 4 c_linear_search_~j~0) .cse6))) (and (or .cse3 (< .cse4 .cse5)) (<= .cse4 .cse5)))))) (= |c_linear_search_#in~n| c_linear_search_~n) (not (= (select .cse9 (+ (* 4 .cse10) |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (= c_~MAX~0 100000) (< 1 .cse11) (not (= (select .cse9 (+ |c_linear_search_#in~a.offset| (* 4 (mod (+ c_linear_search_~j~0 4294967294) 4294967296)))) |c_linear_search_#in~q|)) (<= 3 c_linear_search_~j~0) (or (= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) .cse12) (exists ((|v_main_#t~nondet3_5| Int)) (= c_~SIZE~0 (+ (div (mod |v_main_#t~nondet3_5| 4294967296) 8) 1))) (< .cse11 100000) (= c_linear_search_~j~0 3) (< .cse10 (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))))) (exists ((|v_main_#t~nondet3_5| Int)) (let ((.cse13 (mod |v_main_#t~nondet3_5| 4294967296))) (and (<= 0 .cse13) (= c_~SIZE~0 (+ (div .cse13 8) 1))))) (or .cse0 (and .cse1 (or .cse2 .cse3)))))) is different from true [2019-10-02 11:26:48,437 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-10-02 11:26:49,103 WARN L191 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2019-10-02 11:26:51,221 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (* (- 4) c_linear_search_~j~0))) (let ((.cse10 (* 4 c_linear_search_~j~0)) (.cse9 (div (+ .cse11 (- 4)) 2)) (.cse22 (div c_linear_search_~j~0 4294967296)) (.cse21 (div c_linear_search_~n 4294967296))) (let ((.cse13 (= c_linear_search_~a.offset 0)) (.cse4 (+ (* 4 (div (+ (* 2 c_linear_search_~j~0) (* (- 4294967296) .cse22) (* 4294967296 .cse21) (* (- 1) c_linear_search_~n) (- 1)) 2)) 4)) (.cse5 (+ .cse10 .cse9))) (let ((.cse6 (<= .cse4 .cse5)) (.cse12 (mod c_~SIZE~0 4294967296)) (.cse7 (not (= |c_linear_search_#in~a.offset| 0))) (.cse8 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse0 (not .cse13)) (.cse1 (<= c_linear_search_~j~0 3)) (.cse2 (<= (+ .cse21 1) .cse22)) (.cse3 (and (not (= (select (select |c_#memory_int| c_linear_search_~a.base) (+ (* (- 1) .cse9) c_linear_search_~a.offset)) |c_linear_search_#in~q|)) (= |c_linear_search_#in~a.base| c_linear_search_~a.base)))) (and (or .cse0 (and .cse1 (or .cse2 (not |c_linear_search_#t~short1|) (and (or .cse3 (< .cse4 .cse5)) .cse6)))) (= |c_linear_search_#in~n| c_linear_search_~n) (or .cse7 (and .cse1 (or (and (not (= (select .cse8 (- .cse9)) |c_linear_search_#in~q|)) .cse6) .cse2 (<= .cse4 (+ .cse10 (div (+ .cse11 (- 6)) 2)))))) (= c_~MAX~0 100000) (< 1 .cse12) (<= 3 c_linear_search_~j~0) (or (= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) .cse13) (exists ((|v_main_#t~nondet3_5| Int)) (= c_~SIZE~0 (+ (div (mod |v_main_#t~nondet3_5| 4294967296) 8) 1))) (< .cse12 100000) (let ((.cse16 (div c_~SIZE~0 4294967296))) (let ((.cse19 (div (+ c_~SIZE~0 (* (- 4294967296) .cse16)) 2))) (or (let ((.cse15 (* 4294967296 .cse16))) (let ((.cse14 (+ .cse15 2147483647))) (and (or (< .cse14 c_~SIZE~0) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse15)))) (or (<= c_~SIZE~0 .cse14) (not (= c_~SIZE~0 (+ |c_linear_search_#in~n| .cse15 4294967296))))))) .cse7 (let ((.cse18 (* 4 c_~SIZE~0)) (.cse17 (div .cse19 4294967296))) (and (not (= (select .cse8 (+ (* (- 17179869184) .cse17) .cse18 (* (- 17179869184) .cse16) (* (- 4) .cse19))) |c_linear_search_#in~q|)) (<= .cse18 (+ (* 17179869184 .cse17) (* 8 .cse19) (* 17179869184 .cse16))))) (<= .cse19 0)))) (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))))) (exists ((|v_main_#t~nondet3_5| Int)) (let ((.cse20 (mod |v_main_#t~nondet3_5| 4294967296))) (and (<= 0 .cse20) (= c_~SIZE~0 (+ (div .cse20 8) 1))))) (or .cse0 (and .cse1 (or .cse2 .cse3)))))))) is different from true [2019-10-02 11:26:52,028 WARN L191 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 73 [2019-10-02 11:26:52,496 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 [2019-10-02 11:26:55,401 WARN L191 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 130 DAG size of output: 82 [2019-10-02 11:26:55,778 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-10-02 11:26:58,863 WARN L191 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2019-10-02 11:27:01,487 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 166 DAG size of output: 77 [2019-10-02 11:27:01,846 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-02 11:27:03,712 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2019-10-02 11:27:04,806 WARN L191 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 75 [2019-10-02 11:27:05,023 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-10-02 11:27:05,468 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 69 [2019-10-02 11:27:06,122 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 107 [2019-10-02 11:27:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:08,336 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2019-10-02 11:27:08,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 11:27:08,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-10-02 11:27:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:08,339 INFO L225 Difference]: With dead ends: 103 [2019-10-02 11:27:08,339 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 11:27:08,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=426, Invalid=3239, Unknown=3, NotChecked=238, Total=3906 [2019-10-02 11:27:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 11:27:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2019-10-02 11:27:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-02 11:27:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-02 11:27:08,354 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 32 [2019-10-02 11:27:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:08,355 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-02 11:27:08,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 11:27:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-10-02 11:27:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 11:27:08,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:08,356 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:27:08,356 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:08,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash 260525732, now seen corresponding path program 4 times [2019-10-02 11:27:08,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:08,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:08,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:27:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:27:08,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:27:08,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:27:08,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:27:08,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:27:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:27:08,390 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2019-10-02 11:27:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:27:08,400 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2019-10-02 11:27:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:27:08,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 11:27:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:27:08,401 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:27:08,401 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 11:27:08,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:27:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 11:27:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-02 11:27:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 11:27:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-10-02 11:27:08,409 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2019-10-02 11:27:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:27:08,409 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-10-02 11:27:08,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:27:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-10-02 11:27:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 11:27:08,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:27:08,410 INFO L411 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-10-02 11:27:08,411 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:27:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:27:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash 714347447, now seen corresponding path program 5 times [2019-10-02 11:27:08,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:27:08,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:27:08,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:08,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:27:08,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:27:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:27:10,842 WARN L191 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 203 DAG size of output: 31 [2019-10-02 11:27:11,106 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 35 [2019-10-02 11:27:11,482 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-02 11:27:11,687 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-02 11:27:11,859 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-10-02 11:27:20,819 WARN L191 SmtUtils]: Spent 6.40 s on a formula simplification. DAG size of input: 248 DAG size of output: 49 [2019-10-02 11:27:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:27:20,828 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:27:20,854 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:27:21,349 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-02 11:27:21,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:27:21,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 11:27:21,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:27:21,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:27:31,958 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:27:31,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:27:31,966 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:27:31,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:27:34,034 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2019-10-02 11:27:34,035 INFO L567 ElimStorePlain]: treesize reduction 217, result has 15.2 percent of original size [2019-10-02 11:27:34,035 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-02 11:27:34,035 INFO L464 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2019-10-02 11:27:34,039 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:27:34,039 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 11:27:34,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:27:34,055 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:27:34,055 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-10-02 11:27:36,248 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 11:27:38,587 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-02 11:27:40,859 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-02 11:27:41,259 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-10-02 11:27:44,407 WARN L191 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-02 11:27:50,097 WARN L191 SmtUtils]: Spent 5.39 s on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-10-02 11:27:52,358 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 61 [2019-10-02 11:27:56,634 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-10-02 11:27:57,037 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-10-02 11:27:57,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:27:58,108 WARN L191 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-10-02 11:27:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:27:58,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:27:58,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2019-10-02 11:27:58,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 11:27:58,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 11:27:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1072, Unknown=6, NotChecked=0, Total=1190 [2019-10-02 11:27:58,271 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-10-02 11:27:59,318 WARN L191 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-02 11:28:01,620 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-10-02 11:28:02,726 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-10-02 11:28:04,474 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-02 11:28:09,656 WARN L191 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-10-02 11:28:11,862 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-02 11:28:16,879 WARN L191 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2019-10-02 11:28:17,236 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-10-02 11:28:24,208 WARN L191 SmtUtils]: Spent 6.73 s on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-10-02 11:28:25,080 WARN L191 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-10-02 11:28:25,364 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2019-10-02 11:28:27,824 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2019-10-02 11:28:28,704 WARN L191 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 88 [2019-10-02 11:28:28,917 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-10-02 11:28:29,206 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2019-10-02 11:28:30,057 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 77 [2019-10-02 11:28:31,513 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 156 DAG size of output: 66 [2019-10-02 11:28:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:31,624 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-10-02 11:28:31,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:28:31,627 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-10-02 11:28:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:31,627 INFO L225 Difference]: With dead ends: 50 [2019-10-02 11:28:31,628 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:28:31,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 79.1s TimeCoverageRelationStatistics Valid=322, Invalid=2642, Unknown=6, NotChecked=0, Total=2970 [2019-10-02 11:28:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:28:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 11:28:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:28:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-10-02 11:28:31,643 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2019-10-02 11:28:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:31,643 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-10-02 11:28:31,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 11:28:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-10-02 11:28:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 11:28:31,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:31,645 INFO L411 BasicCegarLoop]: trace histogram [7, 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:28:31,645 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash -920508540, now seen corresponding path program 6 times [2019-10-02 11:28:31,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:31,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:31,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:31,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:31,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:33,626 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 30 [2019-10-02 11:28:34,271 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 40 [2019-10-02 11:28:37,070 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 137 DAG size of output: 75 [2019-10-02 11:28:37,799 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 65 [2019-10-02 11:28:39,839 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_linear_search_~j~0 4294967296))) (let ((.cse0 (+ .cse1 1))) (and (or (<= 6 c_linear_search_~j~0) (< 0 .cse0)) (let ((.cse22 (<= .cse0 0))) (or (and (= |c_linear_search_#in~n| c_linear_search_~n) (or (let ((.cse20 (div c_linear_search_~n 4294967296))) (let ((.cse2 (+ .cse20 1))) (and (or (< .cse1 .cse2) (<= c_linear_search_~j~0 6)) (or (not (= |c_linear_search_#in~a.offset| 0)) (<= .cse2 .cse1) (let ((.cse8 (* (- 1) c_linear_search_~j~0))) (let ((.cse10 (div (+ .cse8 6) 8589934592)) (.cse21 (div (+ c_linear_search_~j~0 (- 5)) 2))) (let ((.cse13 (* 2 c_linear_search_~j~0)) (.cse6 (div (+ (* 2147483647 c_linear_search_~j~0) (* (- 36893488138829168640) .cse1) (* 4294967296 .cse21) (* 27670116106269360128 .cse20) (* (- 6442450943) c_linear_search_~n) 18446744082299486210) 18446744069414584320)) (.cse14 (div (+ (* 6 c_linear_search_~j~0) (* (- 85899345920) .cse1) (* 12 .cse21) (* 77309411328 .cse20) (* (- 18) c_linear_search_~n) (* (- 51539607552) .cse10) 38) 3))) (let ((.cse7 (* 4294967296 .cse20)) (.cse9 (* 4294967296 .cse1)) (.cse4 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse5 (- (* (- 2) c_linear_search_~j~0))) (.cse3 (+ .cse13 (* 17179869184 .cse6) .cse14))) (and (or (< .cse3 0) (not (= (select .cse4 (+ .cse5 (- (* (- 17179869184) .cse6)))) |c_linear_search_#in~q|))) (<= .cse7 (+ c_linear_search_~n (* 2 (div (+ .cse8 .cse9 (* 4294967296 .cse10) (- 1)) 2)) 4)) (<= (+ c_linear_search_~j~0 (* 8589934592 .cse6)) 6) (let ((.cse15 (* (- 8589934592) .cse1)) (.cse16 (* 8589934592 .cse20)) (.cse17 (* (- 2) c_linear_search_~n))) (or (let ((.cse12 (div (+ .cse13 .cse15 .cse16 .cse17 17179869177) 8589934592))) (let ((.cse11 (+ .cse13 (* 17179869184 .cse12) .cse14))) (and (<= .cse11 0) (or (< .cse11 0) (not (= |c_linear_search_#in~q| (select .cse4 (+ .cse5 (- (* (- 17179869184) .cse12)))))))))) (let ((.cse18 (div (+ .cse13 .cse15 .cse16 .cse17 8589934585) 8589934592))) (let ((.cse19 (+ .cse13 (* 17179869184 .cse18) .cse14))) (and (<= .cse7 (+ (* 2 (div (+ .cse8 .cse9 (* 4294967296 .cse18) (- 1)) 2)) c_linear_search_~n 4)) (or (not (= |c_linear_search_#in~q| (select .cse4 (+ .cse5 (- (* (- 17179869184) .cse18)))))) (< .cse19 0)) (<= .cse19 0)))))) (<= .cse3 0)))))))))) .cse22)) .cse22))))) is different from false [2019-10-02 11:28:42,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_linear_search_~j~0 4294967296))) (let ((.cse21 (+ .cse5 1))) (and (or (not (= |c_linear_search_#in~a.offset| 0)) (<= (+ |c_linear_search_#in~n| 4294967290) 0) (let ((.cse7 (* 4294967296 .cse5)) (.cse15 (* (- 8589934592) .cse5)) (.cse20 (* (- 1) |c_linear_search_#in~n|))) (let ((.cse8 (div (+ .cse15 .cse20 6) 8589934592)) (.cse19 (div (+ .cse7 .cse20 (- 5)) 2))) (let ((.cse16 (* (- 2) |c_linear_search_#in~n|)) (.cse11 (div (+ (* 6 c_linear_search_~j~0) (* (- 85899345920) .cse5) (* (- 6) |c_linear_search_#in~n|) (* (- 51539607552) .cse8) (* 12 .cse19) 38) 3)) (.cse12 (* 17179869184 .cse5)) (.cse13 (* 2 |c_linear_search_#in~n|)) (.cse3 (div (+ (* 2147483647 c_linear_search_~j~0) (* (- 36893488138829168640) .cse5) (* (- 2147483647) |c_linear_search_#in~n|) (* 4294967296 .cse19) 18446744082299486210) 18446744069414584320))) (let ((.cse4 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse3))) (.cse6 (* (- 1) c_linear_search_~j~0)) (.cse0 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse1 (- (* (- 17179869184) .cse5))) (.cse2 (- .cse16))) (and (or (not (= |c_linear_search_#in~q| (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse3)))))) (< .cse4 0)) (<= .cse4 0) (<= (+ (* 8589934592 .cse5) |c_linear_search_#in~n| (* 8589934592 .cse3)) 6) (<= 0 (+ (* 2 (div (+ .cse6 .cse7 (* 4294967296 .cse8) (- 1)) 2)) |c_linear_search_#in~n| 4)) (let ((.cse14 (* 2 c_linear_search_~j~0))) (or (let ((.cse9 (div (+ .cse14 .cse15 .cse16 8589934585) 8589934592))) (let ((.cse10 (+ (* 17179869184 .cse9) .cse11 .cse12 .cse13))) (and (<= 0 (+ |c_linear_search_#in~n| (* 2 (div (+ .cse6 (* 4294967296 .cse9) .cse7 (- 1)) 2)) 4)) (or (< .cse10 0) (not (= (select .cse0 (+ (- (* (- 17179869184) .cse9)) .cse1 .cse2)) |c_linear_search_#in~q|))) (<= .cse10 0)))) (let ((.cse18 (div (+ .cse14 .cse15 .cse16 17179869177) 8589934592))) (let ((.cse17 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse18)))) (and (or (< .cse17 0) (not (= (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse18)))) |c_linear_search_#in~q|))) (<= .cse17 0))))))))))) |c_linear_search_#t~short1| (<= .cse21 0)) (or (<= 0 .cse5) (< 0 .cse21))))) is different from false [2019-10-02 11:28:44,190 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_linear_search_~j~0 4294967296))) (let ((.cse21 (+ .cse5 1))) (and (or (not (= |c_linear_search_#in~a.offset| 0)) (<= (+ |c_linear_search_#in~n| 4294967290) 0) (let ((.cse7 (* 4294967296 .cse5)) (.cse15 (* (- 8589934592) .cse5)) (.cse20 (* (- 1) |c_linear_search_#in~n|))) (let ((.cse8 (div (+ .cse15 .cse20 6) 8589934592)) (.cse19 (div (+ .cse7 .cse20 (- 5)) 2))) (let ((.cse16 (* (- 2) |c_linear_search_#in~n|)) (.cse11 (div (+ (* 6 c_linear_search_~j~0) (* (- 85899345920) .cse5) (* (- 6) |c_linear_search_#in~n|) (* (- 51539607552) .cse8) (* 12 .cse19) 38) 3)) (.cse12 (* 17179869184 .cse5)) (.cse13 (* 2 |c_linear_search_#in~n|)) (.cse3 (div (+ (* 2147483647 c_linear_search_~j~0) (* (- 36893488138829168640) .cse5) (* (- 2147483647) |c_linear_search_#in~n|) (* 4294967296 .cse19) 18446744082299486210) 18446744069414584320))) (let ((.cse4 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse3))) (.cse6 (* (- 1) c_linear_search_~j~0)) (.cse0 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse1 (- (* (- 17179869184) .cse5))) (.cse2 (- .cse16))) (and (or (not (= |c_linear_search_#in~q| (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse3)))))) (< .cse4 0)) (<= .cse4 0) (<= (+ (* 8589934592 .cse5) |c_linear_search_#in~n| (* 8589934592 .cse3)) 6) (<= 0 (+ (* 2 (div (+ .cse6 .cse7 (* 4294967296 .cse8) (- 1)) 2)) |c_linear_search_#in~n| 4)) (let ((.cse14 (* 2 c_linear_search_~j~0))) (or (let ((.cse9 (div (+ .cse14 .cse15 .cse16 8589934585) 8589934592))) (let ((.cse10 (+ (* 17179869184 .cse9) .cse11 .cse12 .cse13))) (and (<= 0 (+ |c_linear_search_#in~n| (* 2 (div (+ .cse6 (* 4294967296 .cse9) .cse7 (- 1)) 2)) 4)) (or (< .cse10 0) (not (= (select .cse0 (+ (- (* (- 17179869184) .cse9)) .cse1 .cse2)) |c_linear_search_#in~q|))) (<= .cse10 0)))) (let ((.cse18 (div (+ .cse14 .cse15 .cse16 17179869177) 8589934592))) (let ((.cse17 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse18)))) (and (or (< .cse17 0) (not (= (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse18)))) |c_linear_search_#in~q|))) (<= .cse17 0))))))))))) |c_linear_search_#t~short1| (<= .cse21 0)) (or (<= 0 .cse5) (< 0 .cse21))))) is different from true [2019-10-02 11:28:46,542 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_linear_search_~j~0 4294967296))) (let ((.cse21 (+ .cse5 1))) (and (or (not (= |c_linear_search_#in~a.offset| 0)) (<= (+ |c_linear_search_#in~n| 4294967290) 0) (let ((.cse7 (* 4294967296 .cse5)) (.cse15 (* (- 8589934592) .cse5)) (.cse20 (* (- 1) |c_linear_search_#in~n|))) (let ((.cse8 (div (+ .cse15 .cse20 6) 8589934592)) (.cse19 (div (+ .cse7 .cse20 (- 5)) 2))) (let ((.cse16 (* (- 2) |c_linear_search_#in~n|)) (.cse11 (div (+ (* 6 c_linear_search_~j~0) (* (- 85899345920) .cse5) (* (- 6) |c_linear_search_#in~n|) (* (- 51539607552) .cse8) (* 12 .cse19) 38) 3)) (.cse12 (* 17179869184 .cse5)) (.cse13 (* 2 |c_linear_search_#in~n|)) (.cse3 (div (+ (* 2147483647 c_linear_search_~j~0) (* (- 36893488138829168640) .cse5) (* (- 2147483647) |c_linear_search_#in~n|) (* 4294967296 .cse19) 18446744082299486210) 18446744069414584320))) (let ((.cse4 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse3))) (.cse6 (* (- 1) c_linear_search_~j~0)) (.cse0 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse1 (- (* (- 17179869184) .cse5))) (.cse2 (- .cse16))) (and (or (not (= |c_linear_search_#in~q| (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse3)))))) (< .cse4 0)) (<= .cse4 0) (<= (+ (* 8589934592 .cse5) |c_linear_search_#in~n| (* 8589934592 .cse3)) 6) (<= 0 (+ (* 2 (div (+ .cse6 .cse7 (* 4294967296 .cse8) (- 1)) 2)) |c_linear_search_#in~n| 4)) (let ((.cse14 (* 2 c_linear_search_~j~0))) (or (let ((.cse9 (div (+ .cse14 .cse15 .cse16 8589934585) 8589934592))) (let ((.cse10 (+ (* 17179869184 .cse9) .cse11 .cse12 .cse13))) (and (<= 0 (+ |c_linear_search_#in~n| (* 2 (div (+ .cse6 (* 4294967296 .cse9) .cse7 (- 1)) 2)) 4)) (or (< .cse10 0) (not (= (select .cse0 (+ (- (* (- 17179869184) .cse9)) .cse1 .cse2)) |c_linear_search_#in~q|))) (<= .cse10 0)))) (let ((.cse18 (div (+ .cse14 .cse15 .cse16 17179869177) 8589934592))) (let ((.cse17 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse18)))) (and (or (< .cse17 0) (not (= (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse18)))) |c_linear_search_#in~q|))) (<= .cse17 0))))))))))) (<= .cse21 0)) (or (<= 0 .cse5) (< 0 .cse21))))) is different from false [2019-10-02 11:28:48,548 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_linear_search_~j~0 4294967296))) (let ((.cse21 (+ .cse5 1))) (and (or (not (= |c_linear_search_#in~a.offset| 0)) (<= (+ |c_linear_search_#in~n| 4294967290) 0) (let ((.cse7 (* 4294967296 .cse5)) (.cse15 (* (- 8589934592) .cse5)) (.cse20 (* (- 1) |c_linear_search_#in~n|))) (let ((.cse8 (div (+ .cse15 .cse20 6) 8589934592)) (.cse19 (div (+ .cse7 .cse20 (- 5)) 2))) (let ((.cse16 (* (- 2) |c_linear_search_#in~n|)) (.cse11 (div (+ (* 6 c_linear_search_~j~0) (* (- 85899345920) .cse5) (* (- 6) |c_linear_search_#in~n|) (* (- 51539607552) .cse8) (* 12 .cse19) 38) 3)) (.cse12 (* 17179869184 .cse5)) (.cse13 (* 2 |c_linear_search_#in~n|)) (.cse3 (div (+ (* 2147483647 c_linear_search_~j~0) (* (- 36893488138829168640) .cse5) (* (- 2147483647) |c_linear_search_#in~n|) (* 4294967296 .cse19) 18446744082299486210) 18446744069414584320))) (let ((.cse4 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse3))) (.cse6 (* (- 1) c_linear_search_~j~0)) (.cse0 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse1 (- (* (- 17179869184) .cse5))) (.cse2 (- .cse16))) (and (or (not (= |c_linear_search_#in~q| (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse3)))))) (< .cse4 0)) (<= .cse4 0) (<= (+ (* 8589934592 .cse5) |c_linear_search_#in~n| (* 8589934592 .cse3)) 6) (<= 0 (+ (* 2 (div (+ .cse6 .cse7 (* 4294967296 .cse8) (- 1)) 2)) |c_linear_search_#in~n| 4)) (let ((.cse14 (* 2 c_linear_search_~j~0))) (or (let ((.cse9 (div (+ .cse14 .cse15 .cse16 8589934585) 8589934592))) (let ((.cse10 (+ (* 17179869184 .cse9) .cse11 .cse12 .cse13))) (and (<= 0 (+ |c_linear_search_#in~n| (* 2 (div (+ .cse6 (* 4294967296 .cse9) .cse7 (- 1)) 2)) 4)) (or (< .cse10 0) (not (= (select .cse0 (+ (- (* (- 17179869184) .cse9)) .cse1 .cse2)) |c_linear_search_#in~q|))) (<= .cse10 0)))) (let ((.cse18 (div (+ .cse14 .cse15 .cse16 17179869177) 8589934592))) (let ((.cse17 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse18)))) (and (or (< .cse17 0) (not (= (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse18)))) |c_linear_search_#in~q|))) (<= .cse17 0))))))))))) (<= .cse21 0)) (or (<= 0 .cse5) (< 0 .cse21))))) is different from true [2019-10-02 11:28:48,948 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 70 [2019-10-02 11:28:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2019-10-02 11:28:48,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:48,964 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:28:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:29:13,785 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-02 11:29:13,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-10-02 11:29:14,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:29:14,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-10-02 11:29:14,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 11:29:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 11:29:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=158, Unknown=5, NotChecked=78, Total=272 [2019-10-02 11:29:14,773 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2019-10-02 11:29:15,944 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-10-02 11:29:18,899 WARN L191 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 120 DAG size of output: 98 [2019-10-02 11:30:16,227 WARN L191 SmtUtils]: Spent 53.33 s on a formula simplification. DAG size of input: 147 DAG size of output: 107 [2019-10-02 11:30:18,573 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_linear_search_~j~0 4294967296))) (let ((.cse21 (+ .cse5 1))) (and (<= c_~MAX~0 100000) (or (not (= |c_linear_search_#in~a.offset| 0)) (<= (+ |c_linear_search_#in~n| 4294967290) 0) (let ((.cse7 (* 4294967296 .cse5)) (.cse15 (* (- 8589934592) .cse5)) (.cse20 (* (- 1) |c_linear_search_#in~n|))) (let ((.cse8 (div (+ .cse15 .cse20 6) 8589934592)) (.cse19 (div (+ .cse7 .cse20 (- 5)) 2))) (let ((.cse16 (* (- 2) |c_linear_search_#in~n|)) (.cse11 (div (+ (* 6 c_linear_search_~j~0) (* (- 85899345920) .cse5) (* (- 6) |c_linear_search_#in~n|) (* (- 51539607552) .cse8) (* 12 .cse19) 38) 3)) (.cse12 (* 17179869184 .cse5)) (.cse13 (* 2 |c_linear_search_#in~n|)) (.cse3 (div (+ (* 2147483647 c_linear_search_~j~0) (* (- 36893488138829168640) .cse5) (* (- 2147483647) |c_linear_search_#in~n|) (* 4294967296 .cse19) 18446744082299486210) 18446744069414584320))) (let ((.cse4 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse3))) (.cse6 (* (- 1) c_linear_search_~j~0)) (.cse0 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse1 (- (* (- 17179869184) .cse5))) (.cse2 (- .cse16))) (and (or (not (= |c_linear_search_#in~q| (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse3)))))) (< .cse4 0)) (<= .cse4 0) (<= (+ (* 8589934592 .cse5) |c_linear_search_#in~n| (* 8589934592 .cse3)) 6) (<= 0 (+ (* 2 (div (+ .cse6 .cse7 (* 4294967296 .cse8) (- 1)) 2)) |c_linear_search_#in~n| 4)) (let ((.cse14 (* 2 c_linear_search_~j~0))) (or (let ((.cse9 (div (+ .cse14 .cse15 .cse16 8589934585) 8589934592))) (let ((.cse10 (+ (* 17179869184 .cse9) .cse11 .cse12 .cse13))) (and (<= 0 (+ |c_linear_search_#in~n| (* 2 (div (+ .cse6 (* 4294967296 .cse9) .cse7 (- 1)) 2)) 4)) (or (< .cse10 0) (not (= (select .cse0 (+ (- (* (- 17179869184) .cse9)) .cse1 .cse2)) |c_linear_search_#in~q|))) (<= .cse10 0)))) (let ((.cse18 (div (+ .cse14 .cse15 .cse16 17179869177) 8589934592))) (let ((.cse17 (+ .cse11 .cse12 .cse13 (* 17179869184 .cse18)))) (and (or (< .cse17 0) (not (= (select .cse0 (+ .cse1 .cse2 (- (* (- 17179869184) .cse18)))) |c_linear_search_#in~q|))) (<= .cse17 0))))))))))) |c_linear_search_#t~short1| (<= .cse21 0)) (< 0 (+ (div c_~MAX~0 4294967296) 1)) (or (<= 0 .cse5) (< 0 .cse21))))) is different from false [2019-10-02 11:30:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:30:18,642 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-10-02 11:30:18,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:30:18,643 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2019-10-02 11:30:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:30:18,643 INFO L225 Difference]: With dead ends: 52 [2019-10-02 11:30:18,644 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:30:18,644 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 78.2s TimeCoverageRelationStatistics Valid=85, Invalid=524, Unknown=7, NotChecked=196, Total=812 [2019-10-02 11:30:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:30:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-02 11:30:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:30:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-10-02 11:30:18,652 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2019-10-02 11:30:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:30:18,653 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-10-02 11:30:18,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 11:30:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-10-02 11:30:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 11:30:18,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:30:18,654 INFO L411 BasicCegarLoop]: trace histogram [8, 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:30:18,654 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:30:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:30:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash 13919383, now seen corresponding path program 7 times [2019-10-02 11:30:18,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:30:18,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:30:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:18,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:30:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:30:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:21,179 WARN L191 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 197 DAG size of output: 31 [2019-10-02 11:30:21,639 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2019-10-02 11:30:21,824 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2019-10-02 11:30:22,052 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-10-02 11:30:22,275 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 65 [2019-10-02 11:30:22,578 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-10-02 11:30:22,791 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-10-02 11:30:23,034 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-10-02 11:30:23,207 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-10-02 11:30:23,388 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-10-02 11:30:23,611 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-02 11:30:26,856 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 260 DAG size of output: 47 [2019-10-02 11:30:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:30:26,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:30:26,873 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:26,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:30:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:30:27,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-02 11:30:27,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:30:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:30:29,459 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-10-02 11:30:29,471 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:30:29,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:29,542 INFO L567 ElimStorePlain]: treesize reduction 268, result has 12.7 percent of original size [2019-10-02 11:30:29,543 INFO L464 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2019-10-02 11:30:29,546 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:30:29,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:30:29,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:30:29,560 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_10| vanished before elimination [2019-10-02 11:30:29,560 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:30:29,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:377, output treesize:35 [2019-10-02 11:30:30,618 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-02 11:30:31,235 WARN L191 SmtUtils]: Spent 531.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-02 11:30:32,081 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-02 11:30:33,290 WARN L191 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-02 11:30:33,932 WARN L191 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-02 11:30:39,091 WARN L191 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-10-02 11:30:41,252 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 63 [2019-10-02 11:30:43,406 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-02 11:30:45,684 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-02 11:30:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:30:45,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:30:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2019-10-02 11:30:45,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 11:30:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 11:30:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:30:45,893 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 37 states. [2019-10-02 11:30:46,864 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-10-02 11:30:48,990 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-10-02 11:30:51,549 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-10-02 11:30:55,025 WARN L191 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-02 11:30:55,322 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-10-02 11:30:57,368 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-10-02 11:30:57,668 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-10-02 11:31:00,047 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-10-02 11:31:00,802 WARN L191 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-10-02 11:31:03,937 WARN L191 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2019-10-02 11:31:08,240 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-10-02 11:31:10,622 WARN L191 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 129 DAG size of output: 112 [2019-10-02 11:31:12,957 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 125 DAG size of output: 109 [2019-10-02 11:31:13,236 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-10-02 11:31:16,278 WARN L191 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 133 DAG size of output: 91 [2019-10-02 11:31:18,663 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 129 DAG size of output: 88 [2019-10-02 11:31:20,555 WARN L191 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-10-02 11:31:22,278 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 130 DAG size of output: 101 [2019-10-02 11:31:22,648 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-10-02 11:31:25,841 WARN L191 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 128 DAG size of output: 75 [2019-10-02 11:31:27,538 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 188 DAG size of output: 87 [2019-10-02 11:31:30,114 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 125 DAG size of output: 73 [2019-10-02 11:31:34,439 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 126 DAG size of output: 74 [2019-10-02 11:31:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:31:34,758 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-02 11:31:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 11:31:34,760 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 41 [2019-10-02 11:31:34,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:31:34,761 INFO L225 Difference]: With dead ends: 56 [2019-10-02 11:31:34,761 INFO L226 Difference]: Without dead ends: 46 [2019-10-02 11:31:34,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=378, Invalid=3404, Unknown=0, NotChecked=0, Total=3782 [2019-10-02 11:31:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-02 11:31:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-10-02 11:31:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 11:31:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-10-02 11:31:34,771 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2019-10-02 11:31:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:31:34,771 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-10-02 11:31:34,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 11:31:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-10-02 11:31:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 11:31:34,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:31:34,773 INFO L411 BasicCegarLoop]: trace histogram [9, 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:31:34,773 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:31:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:31:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1873128100, now seen corresponding path program 8 times [2019-10-02 11:31:34,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:31:34,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:31:34,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:34,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:31:34,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:31:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:31:35,253 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 33 [2019-10-02 11:31:36,036 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-02 11:31:37,343 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-10-02 11:31:37,618 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-02 11:31:37,967 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-10-02 11:31:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:31:37,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:31:37,981 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:31:38,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:31:38,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:31:38,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:31:38,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 70 conjunts are in the unsatisfiable core [2019-10-02 11:31:38,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:31:38,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:31:44,326 WARN L191 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 17 [2019-10-02 11:31:44,335 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 11:31:44,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:50,453 WARN L191 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2019-10-02 11:31:50,454 INFO L567 ElimStorePlain]: treesize reduction 290, result has 13.2 percent of original size [2019-10-02 11:31:50,458 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:50,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 11:31:50,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 11:31:50,473 INFO L464 ElimStorePlain]: Eliminatee v_prenex_24 vanished before elimination [2019-10-02 11:31:50,473 INFO L464 ElimStorePlain]: Eliminatee v_prenex_26 vanished before elimination [2019-10-02 11:31:50,473 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:31:50,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:407, output treesize:40 [2019-10-02 11:31:52,876 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-02 11:31:56,477 WARN L191 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-02 11:32:00,247 WARN L191 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-10-02 11:32:02,376 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 52 [2019-10-02 11:32:06,946 WARN L191 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-02 11:32:13,164 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-10-02 11:32:17,005 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-10-02 11:32:17,944 WARN L191 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-10-02 11:32:18,390 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-10-02 11:32:21,149 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-02 11:32:23,293 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 52 [2019-10-02 11:32:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:32:23,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:32:23,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 42 [2019-10-02 11:32:23,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 11:32:23,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 11:32:23,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1595, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 11:32:23,522 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2019-10-02 11:32:26,174 WARN L191 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-10-02 11:32:29,279 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-10-02 11:32:29,912 WARN L191 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-02 11:32:30,606 WARN L191 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-02 11:32:31,703 WARN L191 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-02 11:32:35,071 WARN L191 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-10-02 11:32:36,826 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-02 11:32:37,219 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-10-02 11:32:43,360 WARN L191 SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-02 11:32:44,206 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-02 11:32:46,688 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-10-02 11:32:47,126 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-10-02 11:32:48,642 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-10-02 11:32:49,524 WARN L191 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-10-02 11:32:50,426 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-10-02 11:32:51,280 WARN L191 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2019-10-02 11:32:52,203 WARN L191 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-10-02 11:32:52,607 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2019-10-02 11:32:53,125 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2019-10-02 11:32:55,615 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 172 DAG size of output: 89 [2019-10-02 11:32:57,503 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 166 DAG size of output: 86 [2019-10-02 11:32:58,401 WARN L191 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 86 [2019-10-02 11:32:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:32:58,504 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-10-02 11:32:58,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 11:32:58,506 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2019-10-02 11:32:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:32:58,507 INFO L225 Difference]: With dead ends: 59 [2019-10-02 11:32:58,507 INFO L226 Difference]: Without dead ends: 49 [2019-10-02 11:32:58,510 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 73.4s TimeCoverageRelationStatistics Valid=400, Invalid=4022, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 11:32:58,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-02 11:32:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-10-02 11:32:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-02 11:32:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-10-02 11:32:58,527 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2019-10-02 11:32:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:32:58,527 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-10-02 11:32:58,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 11:32:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-10-02 11:32:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 11:32:58,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:32:58,530 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:32:58,530 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:32:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:32:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1661767031, now seen corresponding path program 9 times [2019-10-02 11:32:58,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:32:58,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:32:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:58,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:32:58,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:32:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:32:59,309 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 40 [2019-10-02 11:33:00,572 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94 [2019-10-02 11:33:01,038 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 84 [2019-10-02 11:33:16,566 WARN L191 SmtUtils]: Spent 13.10 s on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2019-10-02 11:33:17,591 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 67 [2019-10-02 11:33:18,040 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2019-10-02 11:33:18,689 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 52 [2019-10-02 11:33:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:33:18,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:33:18,711 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:33:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:34:12,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-02 11:34:12,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2019-10-02 11:34:12,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:34:12,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-10-02 11:34:12,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:34:12,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:34:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=340, Unknown=1, NotChecked=0, Total=380 [2019-10-02 11:34:12,455 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 20 states. [2019-10-02 11:34:16,089 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 53 [2019-10-02 11:34:18,359 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 56 [2019-10-02 11:34:20,716 WARN L860 $PredicateComparison]: unable to prove that (and (<= c_~MAX~0 100000) (< 0 (+ (div c_~MAX~0 4294967296) 1)) (= |c_linear_search_#in~n| c_linear_search_~n) (or (not (= |c_linear_search_#in~a.offset| 0)) (and (let ((.cse1 (* (- 1) c_linear_search_~j~0)) (.cse3 (* (- 2) c_linear_search_~j~0)) (.cse0 (* 4294967296 (div c_linear_search_~n 4294967296))) (.cse5 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse6 (* 4 (div (+ (* (- 1) c_linear_search_~n) 2) 2))) (.cse2 (* (- 4) c_linear_search_~n))) (or (<= (+ .cse0 (* 4294967296 (div (+ .cse1 (* (- 4294967296) (div (+ (* (- 1) (div (+ .cse2 11) 2)) .cse3 2) 8589934592)) 4294967296) 4294967296)) 9) c_linear_search_~n) (let ((.cse4 (div (+ .cse2 5) 2))) (and (<= (+ (* 4294967296 (div (+ .cse1 (* (- 4294967296) (div (+ (* (- 1) .cse4) .cse3 2) 8589934592)) 4294967296) 4294967296)) .cse0 9) c_linear_search_~n) (not (= |c_linear_search_#in~q| (select .cse5 (- .cse4)))) (<= .cse6 .cse4))) (<= (+ c_linear_search_~j~0 .cse0 4294967279) 0) (let ((.cse7 (div (+ .cse2 9) 2))) (and (<= (+ (* 4294967296 (div (+ .cse1 (* (- 4294967296) (div (+ .cse3 (* (- 1) .cse7) 2) 8589934592)) 4294967296) 4294967296)) .cse0 9) c_linear_search_~n) (or (not (= |c_linear_search_#in~q| (select .cse5 (- .cse7)))) (< .cse6 .cse7)))))) (<= c_linear_search_~j~0 9))) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1))) is different from true [2019-10-02 11:34:21,171 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-10-02 11:34:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:34:21,239 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-10-02 11:34:21,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:34:21,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-10-02 11:34:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:34:21,241 INFO L225 Difference]: With dead ends: 61 [2019-10-02 11:34:21,241 INFO L226 Difference]: Without dead ends: 51 [2019-10-02 11:34:21,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=107, Invalid=1017, Unknown=2, NotChecked=64, Total=1190 [2019-10-02 11:34:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-02 11:34:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-02 11:34:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 11:34:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-10-02 11:34:21,253 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2019-10-02 11:34:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:34:21,253 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-10-02 11:34:21,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:34:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-10-02 11:34:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 11:34:21,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:34:21,255 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:34:21,255 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:34:21,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:34:21,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1426216388, now seen corresponding path program 10 times [2019-10-02 11:34:21,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:34:21,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:34:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:34:21,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:34:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:34:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat