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/array-examples/standard_init1_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:28,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:28,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:28,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:28,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:28,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:28,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:28,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:28,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:28,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:28,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:28,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:28,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:28,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:28,401 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:28,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:28,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:28,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:28,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:28,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:28,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:28,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:28,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:28,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:28,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:28,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:28,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:28,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:28,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:28,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:28,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:28,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:28,432 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:28,433 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:28,433 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:28,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:28,438 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 09:58:28,472 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:28,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:28,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:28,473 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:28,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:28,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:28,474 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:28,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:28,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:28,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:28,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:28,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:28,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:28,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:28,476 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:28,476 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:28,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:28,477 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:28,477 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:28,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:28,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:28,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:28,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:28,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:28,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:28,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:28,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:28,479 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:28,479 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:28,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:28,479 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:28,479 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:28,480 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:28,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:28,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:28,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:28,577 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:28,577 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:28,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_false-unreach-call_ground.i [2018-11-23 09:58:28,649 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e113a97e0/d1dd94630b90438094fef2baf2fbe181/FLAGe582fbee2 [2018-11-23 09:58:29,112 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:29,113 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_false-unreach-call_ground.i [2018-11-23 09:58:29,118 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e113a97e0/d1dd94630b90438094fef2baf2fbe181/FLAGe582fbee2 [2018-11-23 09:58:29,446 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e113a97e0/d1dd94630b90438094fef2baf2fbe181 [2018-11-23 09:58:29,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:29,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:29,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:29,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:29,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:29,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c26b4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29, skipping insertion in model container [2018-11-23 09:58:29,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:29,511 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:29,766 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:29,772 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:29,800 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:29,830 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:29,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29 WrapperNode [2018-11-23 09:58:29,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:29,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:29,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:29,832 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:29,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:29,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:29,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:29,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:29,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:29,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:29,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:29,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:29,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (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 09:58:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:30,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:58:30,546 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:30,546 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 09:58:30,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:30 BoogieIcfgContainer [2018-11-23 09:58:30,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:30,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:30,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:30,552 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:30,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:29" (1/3) ... [2018-11-23 09:58:30,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29adee49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:30, skipping insertion in model container [2018-11-23 09:58:30,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29" (2/3) ... [2018-11-23 09:58:30,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29adee49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:30, skipping insertion in model container [2018-11-23 09:58:30,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:30" (3/3) ... [2018-11-23 09:58:30,556 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init1_false-unreach-call_ground.i [2018-11-23 09:58:30,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:30,573 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:30,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:30,630 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:30,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:30,631 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:30,631 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:30,631 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:30,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:30,632 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:30,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:30,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 09:58:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 09:58:30,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:30,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:30,661 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:30,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 09:58:30,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:30,672 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 09:58:30,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:30,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:30,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 09:58:30,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-23 09:58:30,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 09:58:30,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 09:58:30,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 09:58:30,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {26#true} is VALID [2018-11-23 09:58:30,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 09:58:30,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 0bv32; {27#false} is VALID [2018-11-23 09:58:30,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {27#false} is VALID [2018-11-23 09:58:30,840 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {27#false} is VALID [2018-11-23 09:58:30,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 09:58:30,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0bv32 == ~cond; {27#false} is VALID [2018-11-23 09:58:30,841 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 09:58:30,844 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 09:58:30,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:30,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:30,856 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 09:58:30,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:30,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:30,999 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 09:58:31,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:31,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:31,014 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 09:58:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:31,213 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 09:58:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:31,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 09:58:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 09:58:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 09:58:31,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 09:58:31,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:31,506 INFO L225 Difference]: With dead ends: 39 [2018-11-23 09:58:31,506 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 09:58:31,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 09:58:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 09:58:31,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:31,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 09:58:31,557 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 09:58:31,557 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 09:58:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:31,561 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 09:58:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 09:58:31,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:31,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:31,562 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 09:58:31,562 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 09:58:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:31,566 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 09:58:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 09:58:31,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:31,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:31,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:31,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 09:58:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 09:58:31,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 09:58:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:31,580 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 09:58:31,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 09:58:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 09:58:31,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:31,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:31,583 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:31,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 09:58:31,585 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:31,585 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 09:58:31,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:31,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:31,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {178#true} call ULTIMATE.init(); {178#true} is VALID [2018-11-23 09:58:31,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {178#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {178#true} is VALID [2018-11-23 09:58:31,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#true} assume true; {178#true} is VALID [2018-11-23 09:58:31,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} #48#return; {178#true} is VALID [2018-11-23 09:58:31,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {178#true} call #t~ret2 := main(); {178#true} is VALID [2018-11-23 09:58:31,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {178#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {198#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:31,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {198#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {179#false} is VALID [2018-11-23 09:58:31,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#false} havoc ~x~0;~x~0 := 0bv32; {179#false} is VALID [2018-11-23 09:58:31,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {179#false} is VALID [2018-11-23 09:58:31,938 INFO L256 TraceCheckUtils]: 9: Hoare triple {179#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {179#false} is VALID [2018-11-23 09:58:31,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {179#false} ~cond := #in~cond; {179#false} is VALID [2018-11-23 09:58:31,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {179#false} assume 0bv32 == ~cond; {179#false} is VALID [2018-11-23 09:58:31,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {179#false} assume !false; {179#false} is VALID [2018-11-23 09:58:31,941 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 09:58:31,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:31,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:31,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:31,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 09:58:31,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:31,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:32,128 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 09:58:32,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:32,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:32,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:32,130 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 09:58:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,353 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 09:58:32,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:32,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 09:58:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 09:58:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 09:58:32,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 09:58:32,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:32,437 INFO L225 Difference]: With dead ends: 30 [2018-11-23 09:58:32,437 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 09:58:32,438 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 09:58:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 09:58:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 09:58:32,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:32,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 09:58:32,450 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 09:58:32,451 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 09:58:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,453 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 09:58:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 09:58:32,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:32,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:32,454 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 09:58:32,454 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 09:58:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,456 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 09:58:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 09:58:32,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:32,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:32,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:32,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 09:58:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 09:58:32,459 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 09:58:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:32,459 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 09:58:32,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 09:58:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:58:32,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:32,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:32,461 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:32,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 09:58:32,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:32,462 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 09:58:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:32,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:32,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 09:58:32,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 09:58:32,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 09:58:32,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 09:58:32,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret2 := main(); {327#true} is VALID [2018-11-23 09:58:32,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {347#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:32,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {347#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {351#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:32,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 09:58:32,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 0bv32; {328#false} is VALID [2018-11-23 09:58:32,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {328#false} is VALID [2018-11-23 09:58:32,623 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 09:58:32,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 09:58:32,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 09:58:32,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 09:58:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:32,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:32,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 09:58:32,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 09:58:32,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 09:58:32,998 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 09:58:32,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {328#false} is VALID [2018-11-23 09:58:32,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 0bv32; {328#false} is VALID [2018-11-23 09:58:33,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {391#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 09:58:33,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {391#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:33,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:33,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret2 := main(); {327#true} is VALID [2018-11-23 09:58:33,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 09:58:33,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 09:58:33,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 09:58:33,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 09:58:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:33,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:33,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:33,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 09:58:33,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:33,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:33,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:33,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:33,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:33,234 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 09:58:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:33,542 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 09:58:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:33,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 09:58:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 09:58:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 09:58:33,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 09:58:33,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:33,645 INFO L225 Difference]: With dead ends: 33 [2018-11-23 09:58:33,645 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 09:58:33,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 09:58:33,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 09:58:33,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:33,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,666 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,667 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:33,670 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 09:58:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 09:58:33,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:33,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:33,671 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,671 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:33,673 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 09:58:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 09:58:33,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:33,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:33,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:33,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 09:58:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 09:58:33,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-23 09:58:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:33,677 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 09:58:33,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 09:58:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:58:33,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:33,678 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:33,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:33,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 2 times [2018-11-23 09:58:33,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:33,679 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 09:58:33,702 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:33,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:33,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:33,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:33,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 09:58:33,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 09:58:33,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 09:58:33,916 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 09:58:33,916 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret2 := main(); {544#true} is VALID [2018-11-23 09:58:33,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {564#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:33,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {568#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:33,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {572#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:33,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {576#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:33,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {580#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:33,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {580#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 09:58:33,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 0bv32; {545#false} is VALID [2018-11-23 09:58:33,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {545#false} is VALID [2018-11-23 09:58:33,959 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 09:58:33,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 09:58:33,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 09:58:33,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 09:58:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:33,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:34,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 09:58:34,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 09:58:34,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 09:58:34,264 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 09:58:34,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {545#false} is VALID [2018-11-23 09:58:34,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 0bv32; {545#false} is VALID [2018-11-23 09:58:34,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 09:58:34,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {620#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:34,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,283 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret2 := main(); {544#true} is VALID [2018-11-23 09:58:34,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 09:58:34,284 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 09:58:34,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 09:58:34,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 09:58:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:34,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:34,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 09:58:34,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:34,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:34,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:34,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:34,328 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-11-23 09:58:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:34,988 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 09:58:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:34,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 09:58:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 09:58:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 09:58:34,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2018-11-23 09:58:35,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:35,087 INFO L225 Difference]: With dead ends: 39 [2018-11-23 09:58:35,087 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 09:58:35,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:58:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 09:58:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 09:58:35,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:35,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:35,108 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:35,108 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,111 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 09:58:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 09:58:35,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:35,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:35,112 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:35,113 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,115 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 09:58:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 09:58:35,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:35,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:35,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:35,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 09:58:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 09:58:35,118 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2018-11-23 09:58:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 09:58:35,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 09:58:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:58:35,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:35,120 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:35,120 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 3 times [2018-11-23 09:58:35,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:35,122 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 09:58:35,145 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:35,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:58:35,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:35,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:35,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 09:58:35,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 09:58:35,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 09:58:35,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 09:58:35,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret2 := main(); {827#true} is VALID [2018-11-23 09:58:35,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {847#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:35,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {847#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {851#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {855#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {855#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {859#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {863#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {867#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {871#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 09:58:35,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {875#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {875#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {879#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {883#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:35,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {883#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {887#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 09:58:35,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {887#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 09:58:35,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 0bv32; {828#false} is VALID [2018-11-23 09:58:35,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {828#false} is VALID [2018-11-23 09:58:35,802 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 09:58:35,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 09:58:35,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 09:58:35,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 09:58:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:35,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:36,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 09:58:36,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 09:58:36,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 09:58:36,295 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 09:58:36,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {828#false} is VALID [2018-11-23 09:58:36,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 0bv32; {828#false} is VALID [2018-11-23 09:58:36,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 09:58:36,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {927#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:36,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {931#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {935#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {943#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {939#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {947#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {943#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {951#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {947#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {951#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {955#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {959#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {967#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:36,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret2 := main(); {827#true} is VALID [2018-11-23 09:58:36,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 09:58:36,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 09:58:36,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 09:58:36,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 09:58:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:36,366 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 09:58:36,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:36,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:36,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:36,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:36,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:36,440 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 24 states. [2018-11-23 09:58:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:39,084 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 09:58:39,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:58:39,085 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 09:58:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 09:58:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2018-11-23 09:58:39,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2018-11-23 09:58:39,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:39,219 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:58:39,219 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 09:58:39,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:58:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 09:58:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 09:58:39,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:39,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:39,273 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:39,273 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:39,276 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 09:58:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 09:58:39,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:39,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:39,277 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:39,277 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:39,280 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 09:58:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 09:58:39,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:39,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:39,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:39,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 09:58:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 09:58:39,284 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 23 [2018-11-23 09:58:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:39,284 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 09:58:39,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:58:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 09:58:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:58:39,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:39,286 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:39,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:39,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 4 times [2018-11-23 09:58:39,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:39,288 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:39,303 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:39,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:39,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:39,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:40,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 09:58:40,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1242#true} is VALID [2018-11-23 09:58:40,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 09:58:40,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #48#return; {1242#true} is VALID [2018-11-23 09:58:40,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret2 := main(); {1242#true} is VALID [2018-11-23 09:58:40,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:40,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {1262#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1266#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {1270#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1274#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1278#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1282#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {1282#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1286#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 09:58:40,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1286#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1290#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {1290#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1294#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:40,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {1294#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1298#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {1298#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1302#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {1302#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1306#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 09:58:40,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {1306#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1310#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {1310#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1314#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {1314#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1318#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {1318#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1322#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:58:40,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {1322#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1326#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {1326#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1330#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:58:40,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {1330#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1334#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {1334#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1338#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,202 INFO L273 TraceCheckUtils]: 25: Hoare triple {1338#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1342#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 09:58:40,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {1342#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1346#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {1346#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1350#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:40,205 INFO L273 TraceCheckUtils]: 28: Hoare triple {1350#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1243#false} is VALID [2018-11-23 09:58:40,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} havoc ~x~0;~x~0 := 0bv32; {1243#false} is VALID [2018-11-23 09:58:40,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1243#false} is VALID [2018-11-23 09:58:40,206 INFO L256 TraceCheckUtils]: 31: Hoare triple {1243#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {1243#false} is VALID [2018-11-23 09:58:40,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 09:58:40,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume 0bv32 == ~cond; {1243#false} is VALID [2018-11-23 09:58:40,207 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 09:58:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:40,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:42,062 INFO L273 TraceCheckUtils]: 34: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2018-11-23 09:58:42,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {1243#false} assume 0bv32 == ~cond; {1243#false} is VALID [2018-11-23 09:58:42,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {1243#false} ~cond := #in~cond; {1243#false} is VALID [2018-11-23 09:58:42,064 INFO L256 TraceCheckUtils]: 31: Hoare triple {1243#false} call __VERIFIER_assert((if 43bv32 == #t~mem1 then 1bv32 else 0bv32)); {1243#false} is VALID [2018-11-23 09:58:42,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {1243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1243#false} is VALID [2018-11-23 09:58:42,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {1243#false} havoc ~x~0;~x~0 := 0bv32; {1243#false} is VALID [2018-11-23 09:58:42,065 INFO L273 TraceCheckUtils]: 28: Hoare triple {1390#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1243#false} is VALID [2018-11-23 09:58:42,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1390#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:42,071 INFO L273 TraceCheckUtils]: 26: Hoare triple {1398#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {1402#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1398#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {1406#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1402#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {1410#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1406#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {1414#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1410#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {1418#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1414#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {1422#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1418#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {1426#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1422#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {1430#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1426#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {1434#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1430#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {1438#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1434#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1438#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1442#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {1450#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1446#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {1454#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1450#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {1458#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1454#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1458#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {1466#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1462#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {1470#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1466#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1470#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {1478#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1474#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1478#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:42,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret2 := main(); {1242#true} is VALID [2018-11-23 09:58:42,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #48#return; {1242#true} is VALID [2018-11-23 09:58:42,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2018-11-23 09:58:42,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {1242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1242#true} is VALID [2018-11-23 09:58:42,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2018-11-23 09:58:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:42,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:42,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:58:42,193 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 09:58:42,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:42,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:58:42,341 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 09:58:42,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:58:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:58:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:58:42,343 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 48 states. [2018-11-23 09:58:46,216 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:58:46,699 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:58:47,343 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:58:47,900 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:58:48,444 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:58:49,022 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:58:49,592 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:58:50,153 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 09:58:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:56,198 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2018-11-23 09:58:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:58:56,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 09:58:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:58:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 09:58:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:58:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 09:58:56,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 100 transitions. [2018-11-23 09:58:56,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:56,452 INFO L225 Difference]: With dead ends: 75 [2018-11-23 09:58:56,452 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 09:58:56,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:58:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 09:58:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 09:58:56,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:56,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:56,582 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:56,582 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:56,585 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 09:58:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 09:58:56,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:56,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:56,587 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:56,587 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:56,590 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 09:58:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 09:58:56,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:56,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:56,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:56,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 09:58:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 09:58:56,593 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 35 [2018-11-23 09:58:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:56,594 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 09:58:56,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:58:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 09:58:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 09:58:56,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:56,596 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:56,596 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:56,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:56,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 5 times [2018-11-23 09:58:56,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:56,597 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:56,617 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1