java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:32:13,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:32:13,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:13,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:13,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:13,082 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:13,083 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:13,085 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:13,087 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:13,088 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:13,089 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:13,089 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:13,090 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:13,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:13,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:13,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:13,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:13,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:13,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:13,100 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:13,101 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:13,102 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:13,105 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:13,105 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:13,105 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:13,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:13,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:13,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:13,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:13,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:13,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:13,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:13,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:13,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:13,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:13,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:13,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:32:13,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:13,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:13,133 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:13,133 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:13,134 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:13,134 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:13,134 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:13,135 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:13,135 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:13,135 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:13,135 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:13,135 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:13,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:13,136 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:13,136 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:13,136 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:13,136 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:13,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:13,137 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:13,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:13,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:13,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:13,138 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:13,138 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:13,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:13,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:13,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:13,139 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:13,139 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:13,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:13,139 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:13,139 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:13,139 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:13,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:13,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:13,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:13,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:13,206 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:13,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-23 11:32:13,269 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3eab756/7d6709666409499cb1b33cc5f62e0610/FLAGda12b07dc [2018-11-23 11:32:13,747 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:13,750 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-23 11:32:13,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3eab756/7d6709666409499cb1b33cc5f62e0610/FLAGda12b07dc [2018-11-23 11:32:14,080 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc3eab756/7d6709666409499cb1b33cc5f62e0610 [2018-11-23 11:32:14,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:14,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:14,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:14,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:14,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:14,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d41ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14, skipping insertion in model container [2018-11-23 11:32:14,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:14,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:14,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:14,426 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:14,465 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:14,491 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:14,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14 WrapperNode [2018-11-23 11:32:14,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:14,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:14,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:14,493 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:14,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:14,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:14,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:14,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:14,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (1/1) ... [2018-11-23 11:32:14,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:14,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:14,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:14,584 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:14,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (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 [2018-11-23 11:32:14,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:32:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:32:14,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:14,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:14,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:14,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:32:15,513 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:15,513 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:32:15,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:15 BoogieIcfgContainer [2018-11-23 11:32:15,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:15,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:15,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:15,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:15,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:14" (1/3) ... [2018-11-23 11:32:15,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cef0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:15, skipping insertion in model container [2018-11-23 11:32:15,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:14" (2/3) ... [2018-11-23 11:32:15,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cef0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:15, skipping insertion in model container [2018-11-23 11:32:15,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:15" (3/3) ... [2018-11-23 11:32:15,523 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-23 11:32:15,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:15,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 11:32:15,561 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 11:32:15,595 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:15,595 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:15,596 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:15,596 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:15,596 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:15,596 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:15,597 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:15,597 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:15,597 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 11:32:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:32:15,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:15,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:15,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:15,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2018-11-23 11:32:15,637 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:15,637 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:15,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:15,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:15,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 11:32:15,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {39#true} is VALID [2018-11-23 11:32:15,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 11:32:15,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #92#return; {39#true} is VALID [2018-11-23 11:32:15,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-23 11:32:15,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:15,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:15,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index2~0, 100000bv32); {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:15,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume !~bvult32(~main__index1~0, ~main__index2~0); {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:15,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume !(0bv32 == ~main__loop_entered~0); {40#false} is VALID [2018-11-23 11:32:15,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume ~bvult32(~main__index2~0, ~main__index1~0);havoc ~__tmp_3~0;call #t~mem5 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32);~__tmp_3~0 := (if #t~mem5 == #t~mem6 then 1bv32 else 0bv32);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {40#false} is VALID [2018-11-23 11:32:15,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume 0bv32 == ~__VERIFIER_assert__cond~2; {40#false} is VALID [2018-11-23 11:32:15,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 11:32:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:15,909 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:15,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:15,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:15,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:32:15,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:15,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:16,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:16,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:16,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:16,060 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-23 11:32:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:16,496 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-11-23 11:32:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:16,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:32:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-23 11:32:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-23 11:32:16,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2018-11-23 11:32:16,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:16,758 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:32:16,759 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:32:16,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:32:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-23 11:32:16,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:16,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-23 11:32:16,900 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-23 11:32:16,900 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-23 11:32:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:16,905 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:32:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:32:16,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:16,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:16,907 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-23 11:32:16,907 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-23 11:32:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:16,912 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 11:32:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:32:16,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:16,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:16,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:16,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:32:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:32:16,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2018-11-23 11:32:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:16,920 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:32:16,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:32:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:16,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:16,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:16,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:16,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2018-11-23 11:32:16,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:16,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:17,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:17,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2018-11-23 11:32:17,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {256#true} is VALID [2018-11-23 11:32:17,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-23 11:32:17,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #92#return; {256#true} is VALID [2018-11-23 11:32:17,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret7 := main(); {256#true} is VALID [2018-11-23 11:32:17,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {256#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {256#true} is VALID [2018-11-23 11:32:17,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {256#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {256#true} is VALID [2018-11-23 11:32:17,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#true} assume ~bvult32(~main__index2~0, 100000bv32); {256#true} is VALID [2018-11-23 11:32:17,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#true} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {256#true} is VALID [2018-11-23 11:32:17,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#true} assume ~bvult32(~main__index1~0, 100000bv32); {256#true} is VALID [2018-11-23 11:32:17,229 INFO L273 TraceCheckUtils]: 10: Hoare triple {256#true} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~0 := 1bv32; {291#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} is VALID [2018-11-23 11:32:17,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {291#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {295#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:17,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {257#false} is VALID [2018-11-23 11:32:17,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#false} assume !false; {257#false} is VALID [2018-11-23 11:32:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:17,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:17,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:17,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:32:17,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 11:32:17,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:17,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:32:17,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:17,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:32:17,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:32:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:32:17,377 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2018-11-23 11:32:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:17,931 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:32:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:32:17,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 11:32:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:32:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 11:32:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:32:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 11:32:17,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2018-11-23 11:32:18,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:18,102 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:32:18,102 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:32:18,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:32:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:32:18,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-11-23 11:32:18,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:18,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 33 states. [2018-11-23 11:32:18,132 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 33 states. [2018-11-23 11:32:18,132 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 33 states. [2018-11-23 11:32:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:18,136 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 11:32:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 11:32:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:18,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:18,138 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 49 states. [2018-11-23 11:32:18,138 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 49 states. [2018-11-23 11:32:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:18,142 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 11:32:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 11:32:18,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:18,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:18,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:18,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:32:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-23 11:32:18,147 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-11-23 11:32:18,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:18,148 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-23 11:32:18,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:32:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 11:32:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:18,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:18,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:18,149 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2018-11-23 11:32:18,150 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:18,150 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:18,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:18,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-23 11:32:18,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {515#true} is VALID [2018-11-23 11:32:18,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-23 11:32:18,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #92#return; {515#true} is VALID [2018-11-23 11:32:18,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret7 := main(); {515#true} is VALID [2018-11-23 11:32:18,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {515#true} is VALID [2018-11-23 11:32:18,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:18,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index2~0, 100000bv32); {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:18,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:18,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume !~bvult32(~main__index1~0, 100000bv32); {516#false} is VALID [2018-11-23 11:32:18,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {516#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {516#false} is VALID [2018-11-23 11:32:18,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {516#false} is VALID [2018-11-23 11:32:18,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {516#false} is VALID [2018-11-23 11:32:18,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-23 11:32:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:18,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:18,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:18,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:18,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:32:18,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:18,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:18,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:18,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:18,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:18,326 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-23 11:32:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:18,580 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 11:32:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:18,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:32:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:32:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 11:32:18,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 11:32:18,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:18,709 INFO L225 Difference]: With dead ends: 60 [2018-11-23 11:32:18,709 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:32:18,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:32:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-11-23 11:32:18,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:18,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 33 states. [2018-11-23 11:32:18,729 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 33 states. [2018-11-23 11:32:18,730 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 33 states. [2018-11-23 11:32:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:18,733 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 11:32:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 11:32:18,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:18,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:18,735 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 40 states. [2018-11-23 11:32:18,735 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 40 states. [2018-11-23 11:32:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:18,738 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 11:32:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 11:32:18,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:18,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:18,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:18,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:32:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 11:32:18,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-23 11:32:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:18,742 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 11:32:18,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 11:32:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:32:18,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:18,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:18,743 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:18,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2018-11-23 11:32:18,744 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:18,744 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:18,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:18,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-23 11:32:18,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {766#true} is VALID [2018-11-23 11:32:18,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-23 11:32:18,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #92#return; {766#true} is VALID [2018-11-23 11:32:18,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret7 := main(); {766#true} is VALID [2018-11-23 11:32:18,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {766#true} is VALID [2018-11-23 11:32:18,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {766#true} is VALID [2018-11-23 11:32:18,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume ~bvult32(~main__index2~0, 100000bv32); {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:18,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:18,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, 100000bv32); {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:18,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume !~bvult32(~main__index2~0, 100000bv32); {767#false} is VALID [2018-11-23 11:32:18,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {767#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {767#false} is VALID [2018-11-23 11:32:18,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {767#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {767#false} is VALID [2018-11-23 11:32:18,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {767#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {767#false} is VALID [2018-11-23 11:32:18,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-23 11:32:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:18,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:18,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:18,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:18,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:32:18,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:18,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:18,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:18,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:18,911 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-23 11:32:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:19,070 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 11:32:19,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:19,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:32:19,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 11:32:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 11:32:19,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 11:32:19,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:19,186 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:32:19,186 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:32:19,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:32:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-23 11:32:19,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:19,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-23 11:32:19,218 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-23 11:32:19,218 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-23 11:32:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:19,220 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:32:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:32:19,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:19,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:19,221 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-23 11:32:19,221 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-23 11:32:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:19,224 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:32:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:32:19,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:19,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:19,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:19,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:32:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 11:32:19,228 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-11-23 11:32:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:19,229 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 11:32:19,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:32:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:32:19,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:19,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:19,230 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:19,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2018-11-23 11:32:19,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:19,232 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:19,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 11:32:21,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:27,903 INFO L303 Elim1Store]: Index analysis took 2009 ms [2018-11-23 11:32:27,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-11-23 11:32:31,981 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (let ((.cse0 (bvmul (_ bv4 32) main_~main__index2~0))) (= (bvadd |main_~#main__array~0.offset| .cse0) (bvadd |main_~#main__array~0.offset| .cse0 (_ bv4 32)))) [2018-11-23 11:32:31,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:32:33,985 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) [2018-11-23 11:32:33,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:32:34,019 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:32:34,049 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:32:34,250 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:34,252 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Cannot get equality status from inconsistent ThreeValuedEquivalenceRelation at de.uni_freiburg.informatik.ultimate.util.datastructures.ThreeValuedEquivalenceRelation.getEqualityStatus(ThreeValuedEquivalenceRelation.java:275) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.cheapAndSimpleIndexValueAnalysis(Elim1Store.java:796) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:764) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:32:34,257 INFO L168 Benchmark]: Toolchain (without parser) took 20166.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -495.0 MB). Peak memory consumption was 271.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:34,259 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:34,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:34,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:34,261 INFO L168 Benchmark]: Boogie Preprocessor took 57.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:34,262 INFO L168 Benchmark]: RCFGBuilder took 930.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:34,263 INFO L168 Benchmark]: TraceAbstraction took 18740.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 284.2 MB). Peak memory consumption was 284.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:34,269 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 399.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 930.66 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18740.52 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 284.2 MB). Peak memory consumption was 284.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Cannot get equality status from inconsistent ThreeValuedEquivalenceRelation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Cannot get equality status from inconsistent ThreeValuedEquivalenceRelation: de.uni_freiburg.informatik.ultimate.util.datastructures.ThreeValuedEquivalenceRelation.getEqualityStatus(ThreeValuedEquivalenceRelation.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...