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-multidimensional/init-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:45:03,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:45:03,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:45:03,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:45:03,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:45:03,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:45:03,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:45:03,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:45:03,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:45:03,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:45:03,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:45:03,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:45:03,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:45:03,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:45:03,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:45:03,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:45:03,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:45:03,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:45:03,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:45:03,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:45:03,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:45:03,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:45:03,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:45:03,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:45:03,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:45:03,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:45:03,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:45:03,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:45:03,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:45:03,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:45:03,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:45:03,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:45:03,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:45:03,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:45:03,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:45:03,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:45:03,498 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 10:45:03,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:45:03,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:45:03,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:45:03,514 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:45:03,515 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:45:03,515 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:45:03,515 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:45:03,515 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:45:03,516 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:45:03,516 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:45:03,516 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:45:03,516 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:45:03,516 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:45:03,516 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:45:03,517 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:45:03,517 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:45:03,517 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:45:03,517 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:45:03,517 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:45:03,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:45:03,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:45:03,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:45:03,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:45:03,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:45:03,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:45:03,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:45:03,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:45:03,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:45:03,519 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:45:03,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:45:03,520 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:45:03,520 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:45:03,520 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:45:03,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:45:03,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:45:03,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:45:03,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:45:03,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:45:03,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-23 10:45:03,641 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b508e0d11/89c63e3c3c46425e8573d15b7b07e2a1/FLAGeb17bdc73 [2018-11-23 10:45:04,086 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:45:04,087 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-23 10:45:04,095 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b508e0d11/89c63e3c3c46425e8573d15b7b07e2a1/FLAGeb17bdc73 [2018-11-23 10:45:04,447 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b508e0d11/89c63e3c3c46425e8573d15b7b07e2a1 [2018-11-23 10:45:04,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:45:04,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:45:04,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:45:04,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:45:04,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:45:04,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f59c251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04, skipping insertion in model container [2018-11-23 10:45:04,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:45:04,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:45:04,738 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:45:04,745 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:45:04,780 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:45:04,807 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:45:04,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04 WrapperNode [2018-11-23 10:45:04,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:45:04,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:45:04,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:45:04,809 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:45:04,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:45:04,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:45:04,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:45:04,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:45:04,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (1/1) ... [2018-11-23 10:45:04,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:45:04,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:45:04,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:45:04,873 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:45:04,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (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 10:45:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:45:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:45:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:45:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:45:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:45:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:45:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:45:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:45:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:45:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:45:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:45:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:45:05,614 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:45:05,615 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 10:45:05,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:45:05 BoogieIcfgContainer [2018-11-23 10:45:05,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:45:05,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:45:05,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:45:05,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:45:05,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:45:04" (1/3) ... [2018-11-23 10:45:05,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31247987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:45:05, skipping insertion in model container [2018-11-23 10:45:05,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:45:04" (2/3) ... [2018-11-23 10:45:05,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31247987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:45:05, skipping insertion in model container [2018-11-23 10:45:05,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:45:05" (3/3) ... [2018-11-23 10:45:05,623 INFO L112 eAbstractionObserver]: Analyzing ICFG init-2-n-u_true-unreach-call.i [2018-11-23 10:45:05,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:45:05,639 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:45:05,657 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:45:05,692 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:45:05,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:45:05,693 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:45:05,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:45:05,693 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:45:05,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:45:05,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:45:05,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:45:05,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:45:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 10:45:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:45:05,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:05,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:05,724 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:05,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1832694891, now seen corresponding path program 1 times [2018-11-23 10:45:05,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:05,737 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 10:45:05,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:45:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:05,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:45:06,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 10:45:06,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-23 10:45:06,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 10:45:06,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #73#return; {29#true} is VALID [2018-11-23 10:45:06,084 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2018-11-23 10:45:06,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {49#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:06,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {30#false} is VALID [2018-11-23 10:45:06,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0 := 0bv32;~j~0 := 0bv32; {30#false} is VALID [2018-11-23 10:45:06,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {30#false} is VALID [2018-11-23 10:45:06,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {30#false} is VALID [2018-11-23 10:45:06,117 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {30#false} is VALID [2018-11-23 10:45:06,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 10:45:06,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 10:45:06,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 10:45:06,122 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 10:45:06,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:45:06,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:45:06,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:45:06,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:45:06,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:45:06,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:45:06,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:06,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:45:06,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:45:06,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:45:06,287 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2018-11-23 10:45:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:06,598 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-11-23 10:45:06,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:45:06,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:45:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:45:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:45:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 10:45:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:45:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 10:45:06,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-23 10:45:06,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:06,923 INFO L225 Difference]: With dead ends: 49 [2018-11-23 10:45:06,923 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:45:06,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:45:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:45:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-23 10:45:06,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:45:06,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-11-23 10:45:06,974 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-11-23 10:45:06,974 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-11-23 10:45:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:06,979 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 10:45:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 10:45:06,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:06,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:06,980 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-11-23 10:45:06,981 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-11-23 10:45:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:06,985 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 10:45:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 10:45:06,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:06,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:06,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:45:06,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:45:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:45:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 10:45:06,991 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-23 10:45:06,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:45:06,992 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 10:45:06,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:45:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 10:45:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:45:06,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:06,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:06,996 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:06,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1374604441, now seen corresponding path program 1 times [2018-11-23 10:45:06,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:06,997 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 10:45:07,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:45:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:07,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:45:07,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2018-11-23 10:45:07,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {221#true} is VALID [2018-11-23 10:45:07,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2018-11-23 10:45:07,454 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #73#return; {221#true} is VALID [2018-11-23 10:45:07,454 INFO L256 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret2 := main(); {221#true} is VALID [2018-11-23 10:45:07,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {221#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {241#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:45:07,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {241#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {245#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:07,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {245#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {222#false} is VALID [2018-11-23 10:45:07,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {222#false} is VALID [2018-11-23 10:45:07,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#false} assume !~bvslt32(~i~0, ~m~0); {222#false} is VALID [2018-11-23 10:45:07,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {222#false} ~i~0 := 0bv32;~j~0 := 0bv32; {222#false} is VALID [2018-11-23 10:45:07,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {222#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {222#false} is VALID [2018-11-23 10:45:07,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {222#false} is VALID [2018-11-23 10:45:07,469 INFO L256 TraceCheckUtils]: 13: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {222#false} is VALID [2018-11-23 10:45:07,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2018-11-23 10:45:07,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {222#false} assume 0bv32 == ~cond; {222#false} is VALID [2018-11-23 10:45:07,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {222#false} assume !false; {222#false} is VALID [2018-11-23 10:45:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:45:07,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:45:07,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:45:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:45:07,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 10:45:07,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:45:07,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:45:07,623 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 10:45:07,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:45:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:45:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:45:07,624 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 4 states. [2018-11-23 10:45:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:08,062 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 10:45:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:45:08,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 10:45:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:45:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:45:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 10:45:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:45:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2018-11-23 10:45:08,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2018-11-23 10:45:08,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:08,289 INFO L225 Difference]: With dead ends: 42 [2018-11-23 10:45:08,290 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:45:08,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:45:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:45:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-23 10:45:08,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:45:08,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-23 10:45:08,326 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-23 10:45:08,327 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-23 10:45:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:08,331 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 10:45:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:45:08,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:08,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:08,332 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-23 10:45:08,333 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-23 10:45:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:08,336 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 10:45:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:45:08,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:08,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:08,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:45:08,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:45:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:45:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 10:45:08,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 10:45:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:45:08,341 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 10:45:08,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:45:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 10:45:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:45:08,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:08,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:08,342 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:08,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1853309542, now seen corresponding path program 1 times [2018-11-23 10:45:08,343 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:08,344 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 10:45:08,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:45:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:08,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:45:08,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-23 10:45:08,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {429#true} is VALID [2018-11-23 10:45:08,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-23 10:45:08,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #73#return; {429#true} is VALID [2018-11-23 10:45:08,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret2 := main(); {429#true} is VALID [2018-11-23 10:45:08,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {429#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {449#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:45:08,593 INFO L273 TraceCheckUtils]: 6: Hoare triple {449#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {453#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:08,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {453#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {457#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:08,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {430#false} is VALID [2018-11-23 10:45:08,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {430#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {430#false} is VALID [2018-11-23 10:45:08,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {430#false} assume !~bvslt32(~i~0, ~m~0); {430#false} is VALID [2018-11-23 10:45:08,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {430#false} ~i~0 := 0bv32;~j~0 := 0bv32; {430#false} is VALID [2018-11-23 10:45:08,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {430#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {430#false} is VALID [2018-11-23 10:45:08,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {430#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {430#false} is VALID [2018-11-23 10:45:08,617 INFO L256 TraceCheckUtils]: 14: Hoare triple {430#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {430#false} is VALID [2018-11-23 10:45:08,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {430#false} ~cond := #in~cond; {430#false} is VALID [2018-11-23 10:45:08,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {430#false} assume 0bv32 == ~cond; {430#false} is VALID [2018-11-23 10:45:08,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-23 10:45:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:45:08,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:45:09,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {430#false} assume !false; {430#false} is VALID [2018-11-23 10:45:09,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {430#false} assume 0bv32 == ~cond; {430#false} is VALID [2018-11-23 10:45:09,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {430#false} ~cond := #in~cond; {430#false} is VALID [2018-11-23 10:45:09,031 INFO L256 TraceCheckUtils]: 14: Hoare triple {430#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {430#false} is VALID [2018-11-23 10:45:09,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {430#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {430#false} is VALID [2018-11-23 10:45:09,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {430#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {430#false} is VALID [2018-11-23 10:45:09,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {430#false} ~i~0 := 0bv32;~j~0 := 0bv32; {430#false} is VALID [2018-11-23 10:45:09,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {430#false} assume !~bvslt32(~i~0, ~m~0); {430#false} is VALID [2018-11-23 10:45:09,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {430#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {430#false} is VALID [2018-11-23 10:45:09,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {515#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {430#false} is VALID [2018-11-23 10:45:09,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {515#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:45:09,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#(bvslt (_ bv1 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {519#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:45:09,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {429#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {523#(bvslt (_ bv1 32) main_~n~0)} is VALID [2018-11-23 10:45:09,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret2 := main(); {429#true} is VALID [2018-11-23 10:45:09,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #73#return; {429#true} is VALID [2018-11-23 10:45:09,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2018-11-23 10:45:09,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {429#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {429#true} is VALID [2018-11-23 10:45:09,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {429#true} is VALID [2018-11-23 10:45:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:45:09,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:45:09,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:45:09,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 10:45:09,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:45:09,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:45:09,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:09,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:45:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:45:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:45:09,123 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 8 states. [2018-11-23 10:45:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:10,056 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 10:45:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:45:10,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 10:45:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:45:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:45:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-11-23 10:45:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:45:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-11-23 10:45:10,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2018-11-23 10:45:10,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:10,266 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:45:10,266 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:45:10,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:45:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:45:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 10:45:10,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:45:10,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 10:45:10,369 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 10:45:10,370 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 10:45:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:10,374 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-23 10:45:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 10:45:10,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:10,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:10,375 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 10:45:10,376 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 10:45:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:10,379 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-23 10:45:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 10:45:10,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:10,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:10,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:45:10,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:45:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:45:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 10:45:10,384 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 18 [2018-11-23 10:45:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:45:10,385 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 10:45:10,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:45:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 10:45:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:45:10,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:10,386 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:10,386 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:10,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1799641049, now seen corresponding path program 2 times [2018-11-23 10:45:10,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:10,387 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 10:45:10,405 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:45:10,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:45:10,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:45:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:10,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:45:10,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 10:45:10,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {765#true} is VALID [2018-11-23 10:45:10,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 10:45:10,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #73#return; {765#true} is VALID [2018-11-23 10:45:10,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 10:45:10,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {785#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:45:10,705 INFO L273 TraceCheckUtils]: 6: Hoare triple {785#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {789#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:10,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {789#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {793#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:10,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {793#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {797#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:10,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {797#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {801#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:10,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {801#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {805#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:10,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {805#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {766#false} is VALID [2018-11-23 10:45:10,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {766#false} is VALID [2018-11-23 10:45:10,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {766#false} assume !~bvslt32(~i~0, ~m~0); {766#false} is VALID [2018-11-23 10:45:10,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} ~i~0 := 0bv32;~j~0 := 0bv32; {766#false} is VALID [2018-11-23 10:45:10,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {766#false} is VALID [2018-11-23 10:45:10,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {766#false} is VALID [2018-11-23 10:45:10,713 INFO L256 TraceCheckUtils]: 17: Hoare triple {766#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {766#false} is VALID [2018-11-23 10:45:10,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 10:45:10,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {766#false} assume 0bv32 == ~cond; {766#false} is VALID [2018-11-23 10:45:10,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 10:45:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:45:10,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:45:10,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 10:45:10,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {766#false} assume 0bv32 == ~cond; {766#false} is VALID [2018-11-23 10:45:10,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 10:45:10,968 INFO L256 TraceCheckUtils]: 17: Hoare triple {766#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {766#false} is VALID [2018-11-23 10:45:10,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {766#false} is VALID [2018-11-23 10:45:10,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {766#false} is VALID [2018-11-23 10:45:10,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} ~i~0 := 0bv32;~j~0 := 0bv32; {766#false} is VALID [2018-11-23 10:45:10,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {766#false} assume !~bvslt32(~i~0, ~m~0); {766#false} is VALID [2018-11-23 10:45:10,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {766#false} is VALID [2018-11-23 10:45:10,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {766#false} is VALID [2018-11-23 10:45:10,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {867#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {863#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:45:11,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {871#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {867#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:45:11,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {875#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {871#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:45:11,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {879#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {875#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:45:11,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {883#(bvslt (_ bv4 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {879#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:45:11,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {883#(bvslt (_ bv4 32) main_~n~0)} is VALID [2018-11-23 10:45:11,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 10:45:11,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #73#return; {765#true} is VALID [2018-11-23 10:45:11,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 10:45:11,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {765#true} is VALID [2018-11-23 10:45:11,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 10:45:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:45:11,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:45:11,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:45:11,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 10:45:11,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:45:11,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:45:11,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:11,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:45:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:45:11,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:45:11,439 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 14 states. [2018-11-23 10:45:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:14,641 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-23 10:45:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:45:14,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 10:45:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:45:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:45:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 103 transitions. [2018-11-23 10:45:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:45:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 103 transitions. [2018-11-23 10:45:14,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 103 transitions. [2018-11-23 10:45:15,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:15,071 INFO L225 Difference]: With dead ends: 90 [2018-11-23 10:45:15,071 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 10:45:15,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:45:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 10:45:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 10:45:15,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:45:15,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 10:45:15,232 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 10:45:15,232 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 10:45:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:15,238 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 10:45:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-11-23 10:45:15,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:15,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:15,240 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 10:45:15,240 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 10:45:15,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:15,246 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 10:45:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-11-23 10:45:15,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:15,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:15,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:45:15,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:45:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 10:45:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-23 10:45:15,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 21 [2018-11-23 10:45:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:45:15,253 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-23 10:45:15,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:45:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-23 10:45:15,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:45:15,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:15,255 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:15,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:15,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1047354553, now seen corresponding path program 3 times [2018-11-23 10:45:15,257 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:15,257 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 10:45:15,277 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:45:15,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:45:15,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:45:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:15,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:45:15,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2018-11-23 10:45:15,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {1284#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1284#true} is VALID [2018-11-23 10:45:15,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {1284#true} assume true; {1284#true} is VALID [2018-11-23 10:45:15,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1284#true} {1284#true} #73#return; {1284#true} is VALID [2018-11-23 10:45:15,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {1284#true} call #t~ret2 := main(); {1284#true} is VALID [2018-11-23 10:45:15,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {1284#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:45:15,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {1304#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1344#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:15,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {1344#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {1285#false} is VALID [2018-11-23 10:45:15,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {1285#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1285#false} is VALID [2018-11-23 10:45:15,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {1285#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {1285#false} is VALID [2018-11-23 10:45:15,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {1285#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {1285#false} is VALID [2018-11-23 10:45:15,578 INFO L256 TraceCheckUtils]: 23: Hoare triple {1285#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1285#false} is VALID [2018-11-23 10:45:15,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {1285#false} ~cond := #in~cond; {1285#false} is VALID [2018-11-23 10:45:15,578 INFO L273 TraceCheckUtils]: 25: Hoare triple {1285#false} assume 0bv32 == ~cond; {1285#false} is VALID [2018-11-23 10:45:15,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2018-11-23 10:45:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:45:15,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:45:15,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2018-11-23 10:45:15,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {1285#false} assume 0bv32 == ~cond; {1285#false} is VALID [2018-11-23 10:45:15,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {1285#false} ~cond := #in~cond; {1285#false} is VALID [2018-11-23 10:45:15,748 INFO L256 TraceCheckUtils]: 23: Hoare triple {1285#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1285#false} is VALID [2018-11-23 10:45:15,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {1285#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {1285#false} is VALID [2018-11-23 10:45:15,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {1285#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {1285#false} is VALID [2018-11-23 10:45:15,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {1285#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1285#false} is VALID [2018-11-23 10:45:15,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {1390#(bvslt main_~i~0 main_~m~0)} assume !~bvslt32(~i~0, ~m~0); {1285#false} is VALID [2018-11-23 10:45:15,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1390#(bvslt main_~i~0 main_~m~0)} is VALID [2018-11-23 10:45:15,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~j~0, ~n~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {1284#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {1394#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:45:15,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {1284#true} call #t~ret2 := main(); {1284#true} is VALID [2018-11-23 10:45:15,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1284#true} {1284#true} #73#return; {1284#true} is VALID [2018-11-23 10:45:15,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {1284#true} assume true; {1284#true} is VALID [2018-11-23 10:45:15,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {1284#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1284#true} is VALID [2018-11-23 10:45:15,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2018-11-23 10:45:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:45:15,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:45:15,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:45:15,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 10:45:15,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:45:15,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:45:15,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:15,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:45:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:45:15,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:45:15,878 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 6 states. [2018-11-23 10:45:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:16,858 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2018-11-23 10:45:16,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:45:16,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-23 10:45:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:45:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:45:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:45:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:45:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:45:16,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 10:45:16,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:16,984 INFO L225 Difference]: With dead ends: 139 [2018-11-23 10:45:16,984 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 10:45:16,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:45:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 10:45:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-23 10:45:17,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:45:17,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 99 states. [2018-11-23 10:45:17,205 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-23 10:45:17,205 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-23 10:45:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:17,212 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-23 10:45:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-23 10:45:17,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:17,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:17,214 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-23 10:45:17,214 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-23 10:45:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:17,220 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2018-11-23 10:45:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-23 10:45:17,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:17,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:17,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:45:17,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:45:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 10:45:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-11-23 10:45:17,227 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 27 [2018-11-23 10:45:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:45:17,228 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-11-23 10:45:17,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:45:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-11-23 10:45:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 10:45:17,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:17,230 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:17,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:17,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2005868693, now seen corresponding path program 4 times [2018-11-23 10:45:17,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:17,233 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 10:45:17,262 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:45:17,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:45:17,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:45:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:45:17,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:45:18,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {2064#true} call ULTIMATE.init(); {2064#true} is VALID [2018-11-23 10:45:18,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {2064#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2064#true} is VALID [2018-11-23 10:45:18,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {2064#true} assume true; {2064#true} is VALID [2018-11-23 10:45:18,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2064#true} {2064#true} #73#return; {2064#true} is VALID [2018-11-23 10:45:18,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {2064#true} call #t~ret2 := main(); {2064#true} is VALID [2018-11-23 10:45:18,008 INFO L273 TraceCheckUtils]: 5: Hoare triple {2064#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {2084#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:45:18,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {2084#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2088#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:18,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {2088#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2092#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:18,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {2092#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2096#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:18,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {2096#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2100#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:18,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {2100#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2104#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:18,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {2104#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2108#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:18,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {2108#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2112#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:18,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {2112#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2116#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:18,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {2116#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2120#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:18,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {2120#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2124#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:45:18,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {2124#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2128#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:45:18,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {2128#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,018 INFO L273 TraceCheckUtils]: 19: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {2065#false} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,023 INFO L273 TraceCheckUtils]: 35: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,023 INFO L273 TraceCheckUtils]: 40: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,024 INFO L273 TraceCheckUtils]: 41: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,024 INFO L273 TraceCheckUtils]: 42: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,024 INFO L273 TraceCheckUtils]: 43: Hoare triple {2065#false} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,025 INFO L273 TraceCheckUtils]: 45: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,025 INFO L273 TraceCheckUtils]: 46: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,025 INFO L273 TraceCheckUtils]: 47: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,026 INFO L273 TraceCheckUtils]: 48: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,026 INFO L273 TraceCheckUtils]: 49: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,027 INFO L273 TraceCheckUtils]: 52: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,027 INFO L273 TraceCheckUtils]: 53: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,027 INFO L273 TraceCheckUtils]: 54: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,028 INFO L273 TraceCheckUtils]: 55: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,028 INFO L273 TraceCheckUtils]: 56: Hoare triple {2065#false} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,028 INFO L273 TraceCheckUtils]: 57: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,028 INFO L273 TraceCheckUtils]: 58: Hoare triple {2065#false} assume !~bvslt32(~i~0, ~m~0); {2065#false} is VALID [2018-11-23 10:45:18,029 INFO L273 TraceCheckUtils]: 59: Hoare triple {2065#false} ~i~0 := 0bv32;~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,029 INFO L273 TraceCheckUtils]: 60: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,029 INFO L273 TraceCheckUtils]: 61: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {2065#false} is VALID [2018-11-23 10:45:18,030 INFO L256 TraceCheckUtils]: 62: Hoare triple {2065#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {2065#false} is VALID [2018-11-23 10:45:18,030 INFO L273 TraceCheckUtils]: 63: Hoare triple {2065#false} ~cond := #in~cond; {2065#false} is VALID [2018-11-23 10:45:18,030 INFO L273 TraceCheckUtils]: 64: Hoare triple {2065#false} assume 0bv32 == ~cond; {2065#false} is VALID [2018-11-23 10:45:18,030 INFO L273 TraceCheckUtils]: 65: Hoare triple {2065#false} assume !false; {2065#false} is VALID [2018-11-23 10:45:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 367 proven. 55 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-11-23 10:45:18,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:45:18,597 INFO L273 TraceCheckUtils]: 65: Hoare triple {2065#false} assume !false; {2065#false} is VALID [2018-11-23 10:45:18,597 INFO L273 TraceCheckUtils]: 64: Hoare triple {2065#false} assume 0bv32 == ~cond; {2065#false} is VALID [2018-11-23 10:45:18,598 INFO L273 TraceCheckUtils]: 63: Hoare triple {2065#false} ~cond := #in~cond; {2065#false} is VALID [2018-11-23 10:45:18,598 INFO L256 TraceCheckUtils]: 62: Hoare triple {2065#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {2065#false} is VALID [2018-11-23 10:45:18,599 INFO L273 TraceCheckUtils]: 61: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {2065#false} is VALID [2018-11-23 10:45:18,599 INFO L273 TraceCheckUtils]: 60: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,599 INFO L273 TraceCheckUtils]: 59: Hoare triple {2065#false} ~i~0 := 0bv32;~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {2065#false} assume !~bvslt32(~i~0, ~m~0); {2065#false} is VALID [2018-11-23 10:45:18,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,600 INFO L273 TraceCheckUtils]: 56: Hoare triple {2065#false} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,600 INFO L273 TraceCheckUtils]: 55: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,601 INFO L273 TraceCheckUtils]: 53: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,601 INFO L273 TraceCheckUtils]: 52: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {2065#false} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,606 INFO L273 TraceCheckUtils]: 32: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {2065#false} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {2065#false} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2065#false} is VALID [2018-11-23 10:45:18,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {2065#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2065#false} is VALID [2018-11-23 10:45:18,609 INFO L273 TraceCheckUtils]: 18: Hoare triple {2065#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2065#false} is VALID [2018-11-23 10:45:18,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {2420#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {2065#false} is VALID [2018-11-23 10:45:18,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {2424#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2420#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:45:18,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {2428#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2424#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:45:18,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {2432#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2428#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:45:18,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {2436#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2432#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:45:18,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {2440#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2436#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:45:18,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {2444#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2440#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} is VALID [2018-11-23 10:45:19,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {2448#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2444#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} is VALID [2018-11-23 10:45:19,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {2452#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2448#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} is VALID [2018-11-23 10:45:19,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {2456#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2452#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} is VALID [2018-11-23 10:45:19,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {2460#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {2456#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} is VALID [2018-11-23 10:45:19,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {2464#(bvslt (_ bv10 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2460#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} is VALID [2018-11-23 10:45:19,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {2064#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32; {2464#(bvslt (_ bv10 32) main_~n~0)} is VALID [2018-11-23 10:45:19,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {2064#true} call #t~ret2 := main(); {2064#true} is VALID [2018-11-23 10:45:19,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2064#true} {2064#true} #73#return; {2064#true} is VALID [2018-11-23 10:45:19,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {2064#true} assume true; {2064#true} is VALID [2018-11-23 10:45:19,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {2064#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2064#true} is VALID [2018-11-23 10:45:19,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {2064#true} call ULTIMATE.init(); {2064#true} is VALID [2018-11-23 10:45:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 367 proven. 55 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-11-23 10:45:19,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:45:19,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 10:45:19,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2018-11-23 10:45:19,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:45:19,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:45:19,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:19,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:45:19,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:45:19,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:45:19,918 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 26 states. [2018-11-23 10:45:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:32,183 INFO L93 Difference]: Finished difference Result 265 states and 366 transitions. [2018-11-23 10:45:32,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 10:45:32,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2018-11-23 10:45:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:45:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:45:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 175 transitions. [2018-11-23 10:45:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:45:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 175 transitions. [2018-11-23 10:45:32,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 175 transitions. [2018-11-23 10:45:32,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:32,865 INFO L225 Difference]: With dead ends: 265 [2018-11-23 10:45:32,865 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 10:45:32,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:45:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 10:45:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-11-23 10:45:33,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:45:33,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 183 states. [2018-11-23 10:45:33,481 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 183 states. [2018-11-23 10:45:33,481 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 183 states. [2018-11-23 10:45:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:33,491 INFO L93 Difference]: Finished difference Result 184 states and 211 transitions. [2018-11-23 10:45:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2018-11-23 10:45:33,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:33,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:33,493 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 184 states. [2018-11-23 10:45:33,493 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 184 states. [2018-11-23 10:45:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:45:33,502 INFO L93 Difference]: Finished difference Result 184 states and 211 transitions. [2018-11-23 10:45:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2018-11-23 10:45:33,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:45:33,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:45:33,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:45:33,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:45:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-23 10:45:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2018-11-23 10:45:33,512 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 66 [2018-11-23 10:45:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:45:33,513 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2018-11-23 10:45:33,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 10:45:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2018-11-23 10:45:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 10:45:33,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:45:33,517 INFO L402 BasicCegarLoop]: trace histogram [88, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:45:33,518 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:45:33,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:45:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash 167723883, now seen corresponding path program 5 times [2018-11-23 10:45:33,519 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:45:33,519 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 10:45:33,550 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1