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-4-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:47:20,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:47:20,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:47:20,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:47:20,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:47:20,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:47:20,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:47:20,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:47:20,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:47:20,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:47:20,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:47:20,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:47:20,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:47:20,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:47:20,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:47:20,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:47:20,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:47:20,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:47:20,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:47:20,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:47:20,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:47:20,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:47:20,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:47:20,910 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:47:20,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:47:20,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:47:20,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:47:20,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:47:20,920 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:47:20,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:47:20,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:47:20,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:47:20,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:47:20,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:47:20,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:47:20,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:47:20,928 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:47:20,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:47:20,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:47:20,957 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:47:20,957 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:47:20,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:47:20,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:47:20,958 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:47:20,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:47:20,959 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:47:20,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:47:20,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:47:20,959 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:47:20,959 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:47:20,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:47:20,960 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:47:20,960 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:47:20,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:47:20,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:47:20,960 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:47:20,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:47:20,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:47:20,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:47:20,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:47:20,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:47:20,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:47:20,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:47:20,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:47:20,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:47:20,963 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:47:20,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:47:20,963 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:47:20,963 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:47:20,963 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:47:21,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:47:21,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:47:21,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:47:21,028 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:47:21,029 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:47:21,029 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i [2018-11-23 10:47:21,091 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee5a630/304c7c34feea4f899eedf4cab5b563de/FLAG4f1f53dd6 [2018-11-23 10:47:21,575 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:47:21,576 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i [2018-11-23 10:47:21,583 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee5a630/304c7c34feea4f899eedf4cab5b563de/FLAG4f1f53dd6 [2018-11-23 10:47:21,931 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee5a630/304c7c34feea4f899eedf4cab5b563de [2018-11-23 10:47:21,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:47:21,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:47:21,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:47:21,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:47:21,947 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:47:21,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:21" (1/1) ... [2018-11-23 10:47:21,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b55cb15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:21, skipping insertion in model container [2018-11-23 10:47:21,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:21" (1/1) ... [2018-11-23 10:47:21,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:47:21,989 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:47:22,264 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:47:22,270 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:47:22,323 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:47:22,361 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:47:22,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22 WrapperNode [2018-11-23 10:47:22,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:47:22,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:47:22,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:47:22,363 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:47:22,374 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:47:22" (1/1) ... [2018-11-23 10:47:22,385 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:47:22" (1/1) ... [2018-11-23 10:47:22,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:47:22,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:47:22,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:47:22,395 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:47:22,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (1/1) ... [2018-11-23 10:47:22,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:47:22,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:47:22,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:47:22,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:47:22,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (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:47:22,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:47:22,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:47:22,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:47:22,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:47:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:47:22,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:47:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:47:22,591 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:47:22,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:47:22,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:47:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:47:22,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:47:23,500 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:47:23,500 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 10:47:23,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:23 BoogieIcfgContainer [2018-11-23 10:47:23,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:47:23,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:47:23,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:47:23,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:47:23,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:21" (1/3) ... [2018-11-23 10:47:23,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbfbe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:23, skipping insertion in model container [2018-11-23 10:47:23,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:22" (2/3) ... [2018-11-23 10:47:23,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbfbe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:23, skipping insertion in model container [2018-11-23 10:47:23,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:23" (3/3) ... [2018-11-23 10:47:23,510 INFO L112 eAbstractionObserver]: Analyzing ICFG init-4-n-u_true-unreach-call.i [2018-11-23 10:47:23,519 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:47:23,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:47:23,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:47:23,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:47:23,579 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:47:23,579 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:47:23,580 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:47:23,581 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:47:23,581 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:47:23,581 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:47:23,582 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:47:23,582 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:47:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 10:47:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:47:23,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:23,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:23,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:23,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:23,623 INFO L82 PathProgramCache]: Analyzing trace with hash -129587761, now seen corresponding path program 1 times [2018-11-23 10:47:23,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:23,629 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:47:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:23,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:24,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 10:47:24,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-23 10:47:24,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 10:47:24,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #125#return; {37#true} is VALID [2018-11-23 10:47:24,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret2 := main(); {37#true} is VALID [2018-11-23 10:47:24,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {37#true} is VALID [2018-11-23 10:47:24,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 10:47:24,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {38#false} is VALID [2018-11-23 10:47:24,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {38#false} is VALID [2018-11-23 10:47:24,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {38#false} is VALID [2018-11-23 10:47:24,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {38#false} is VALID [2018-11-23 10:47:24,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {38#false} is VALID [2018-11-23 10:47:24,055 INFO L256 TraceCheckUtils]: 12: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {38#false} is VALID [2018-11-23 10:47:24,056 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 10:47:24,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume 0bv32 == ~cond; {38#false} is VALID [2018-11-23 10:47:24,057 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 10:47:24,060 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:47:24,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:24,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:24,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:47:24,070 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 10:47:24,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:24,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:47:24,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:24,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:47:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:47:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:47:24,226 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 10:47:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:24,613 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2018-11-23 10:47:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:47:24,614 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 10:47:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:47:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 10:47:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:47:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 10:47:24,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 95 transitions. [2018-11-23 10:47:25,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:25,098 INFO L225 Difference]: With dead ends: 62 [2018-11-23 10:47:25,098 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:47:25,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:47:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:47:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 10:47:25,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:25,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 10:47:25,217 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 10:47:25,217 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 10:47:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:25,222 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 10:47:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 10:47:25,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:25,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:25,224 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 10:47:25,224 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 10:47:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:25,229 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 10:47:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 10:47:25,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:25,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:25,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:25,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 10:47:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 10:47:25,237 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2018-11-23 10:47:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:25,238 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 10:47:25,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:47:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 10:47:25,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:47:25,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:25,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:25,240 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:25,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash -269441638, now seen corresponding path program 1 times [2018-11-23 10:47:25,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:25,241 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:47:25,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:25,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:25,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2018-11-23 10:47:25,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {273#true} is VALID [2018-11-23 10:47:25,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2018-11-23 10:47:25,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #125#return; {273#true} is VALID [2018-11-23 10:47:25,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret2 := main(); {273#true} is VALID [2018-11-23 10:47:25,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {293#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:25,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {293#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {274#false} is VALID [2018-11-23 10:47:25,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {274#false} is VALID [2018-11-23 10:47:25,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {274#false} is VALID [2018-11-23 10:47:25,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {274#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {274#false} is VALID [2018-11-23 10:47:25,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {274#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {274#false} is VALID [2018-11-23 10:47:25,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {274#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {274#false} is VALID [2018-11-23 10:47:25,802 INFO L256 TraceCheckUtils]: 12: Hoare triple {274#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {274#false} is VALID [2018-11-23 10:47:25,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {274#false} ~cond := #in~cond; {274#false} is VALID [2018-11-23 10:47:25,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {274#false} assume 0bv32 == ~cond; {274#false} is VALID [2018-11-23 10:47:25,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-11-23 10:47:25,804 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:47:25,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:25,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:25,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:47:25,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:47:25,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:25,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:47:25,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:25,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:47:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:47:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:47:25,918 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2018-11-23 10:47:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:26,926 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-23 10:47:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:47:26,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:47:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:47:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:47:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:47:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:47:26,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 10:47:27,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:27,352 INFO L225 Difference]: With dead ends: 52 [2018-11-23 10:47:27,352 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 10:47:27,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:47:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 10:47:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-23 10:47:27,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:27,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-23 10:47:27,384 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-23 10:47:27,384 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-23 10:47:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:27,388 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 10:47:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 10:47:27,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:27,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:27,390 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-23 10:47:27,390 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-23 10:47:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:27,393 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-23 10:47:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2018-11-23 10:47:27,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:27,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:27,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:27,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:27,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:47:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 10:47:27,397 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2018-11-23 10:47:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:27,398 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 10:47:27,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:47:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 10:47:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:47:27,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:27,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:27,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:27,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1901462552, now seen corresponding path program 1 times [2018-11-23 10:47:27,400 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:27,401 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:47:27,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:27,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:27,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2018-11-23 10:47:27,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {516#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {516#true} is VALID [2018-11-23 10:47:27,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2018-11-23 10:47:27,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #125#return; {516#true} is VALID [2018-11-23 10:47:27,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret2 := main(); {516#true} is VALID [2018-11-23 10:47:27,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {536#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:47:27,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {540#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:47:27,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {517#false} is VALID [2018-11-23 10:47:27,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {517#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {517#false} is VALID [2018-11-23 10:47:27,640 INFO L273 TraceCheckUtils]: 9: Hoare triple {517#false} assume !~bvslt32(~i~0, ~m~0); {517#false} is VALID [2018-11-23 10:47:27,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {517#false} is VALID [2018-11-23 10:47:27,640 INFO L273 TraceCheckUtils]: 11: Hoare triple {517#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {517#false} is VALID [2018-11-23 10:47:27,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {517#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {517#false} is VALID [2018-11-23 10:47:27,641 INFO L273 TraceCheckUtils]: 13: Hoare triple {517#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {517#false} is VALID [2018-11-23 10:47:27,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {517#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {517#false} is VALID [2018-11-23 10:47:27,641 INFO L256 TraceCheckUtils]: 15: Hoare triple {517#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {517#false} is VALID [2018-11-23 10:47:27,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#false} ~cond := #in~cond; {517#false} is VALID [2018-11-23 10:47:27,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {517#false} assume 0bv32 == ~cond; {517#false} is VALID [2018-11-23 10:47:27,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {517#false} assume !false; {517#false} is VALID [2018-11-23 10:47:27,644 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:47:27,644 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [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:47:27,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:27,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:47:27,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 10:47:27,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:27,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:47:27,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:27,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:47:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:47:27,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:27,750 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2018-11-23 10:47:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:28,747 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-23 10:47:28,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:47:28,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 10:47:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 10:47:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-23 10:47:28,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-23 10:47:29,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:29,147 INFO L225 Difference]: With dead ends: 66 [2018-11-23 10:47:29,148 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 10:47:29,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 10:47:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-11-23 10:47:29,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:29,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 32 states. [2018-11-23 10:47:29,197 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 32 states. [2018-11-23 10:47:29,197 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 32 states. [2018-11-23 10:47:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:29,203 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-23 10:47:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 10:47:29,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:29,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:29,204 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 43 states. [2018-11-23 10:47:29,204 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 43 states. [2018-11-23 10:47:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:29,208 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-11-23 10:47:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 10:47:29,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:29,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:29,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:29,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:47:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 10:47:29,212 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2018-11-23 10:47:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:29,212 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 10:47:29,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:47:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 10:47:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:47:29,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:29,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:29,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:29,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:29,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1769523126, now seen corresponding path program 1 times [2018-11-23 10:47:29,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:29,215 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:47:29,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:29,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:29,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {810#true} call ULTIMATE.init(); {810#true} is VALID [2018-11-23 10:47:29,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {810#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {810#true} is VALID [2018-11-23 10:47:29,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {810#true} assume true; {810#true} is VALID [2018-11-23 10:47:29,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {810#true} {810#true} #125#return; {810#true} is VALID [2018-11-23 10:47:29,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {810#true} call #t~ret2 := main(); {810#true} is VALID [2018-11-23 10:47:29,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {810#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {830#(= (_ bv1800 32) main_~p~0)} is VALID [2018-11-23 10:47:29,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {830#(= (_ bv1800 32) main_~p~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {830#(= (_ bv1800 32) main_~p~0)} is VALID [2018-11-23 10:47:29,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {830#(= (_ bv1800 32) main_~p~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {837#(and (= (_ bv1800 32) main_~p~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:29,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {837#(and (= (_ bv1800 32) main_~p~0) (= main_~k~0 (_ bv0 32)))} assume !~bvslt32(~k~0, ~p~0); {811#false} is VALID [2018-11-23 10:47:29,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {811#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {811#false} is VALID [2018-11-23 10:47:29,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {811#false} assume !~bvslt32(~j~0, ~n~0); {811#false} is VALID [2018-11-23 10:47:29,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {811#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {811#false} is VALID [2018-11-23 10:47:29,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {811#false} assume !~bvslt32(~i~0, ~m~0); {811#false} is VALID [2018-11-23 10:47:29,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {811#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {811#false} is VALID [2018-11-23 10:47:29,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {811#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {811#false} is VALID [2018-11-23 10:47:29,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {811#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {811#false} is VALID [2018-11-23 10:47:29,375 INFO L273 TraceCheckUtils]: 16: Hoare triple {811#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {811#false} is VALID [2018-11-23 10:47:29,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {811#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {811#false} is VALID [2018-11-23 10:47:29,375 INFO L256 TraceCheckUtils]: 18: Hoare triple {811#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {811#false} is VALID [2018-11-23 10:47:29,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {811#false} ~cond := #in~cond; {811#false} is VALID [2018-11-23 10:47:29,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {811#false} assume 0bv32 == ~cond; {811#false} is VALID [2018-11-23 10:47:29,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {811#false} assume !false; {811#false} is VALID [2018-11-23 10:47:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:29,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:29,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:29,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:47:29,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 10:47:29,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:29,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:47:29,450 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:47:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:47:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:47:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:29,451 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 4 states. [2018-11-23 10:47:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:30,468 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 10:47:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:47:30,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 10:47:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 10:47:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2018-11-23 10:47:30,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2018-11-23 10:47:30,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:30,902 INFO L225 Difference]: With dead ends: 66 [2018-11-23 10:47:30,902 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 10:47:30,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 10:47:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-23 10:47:31,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:31,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2018-11-23 10:47:31,058 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2018-11-23 10:47:31,058 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2018-11-23 10:47:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:31,061 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 10:47:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 10:47:31,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:31,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:31,063 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2018-11-23 10:47:31,063 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2018-11-23 10:47:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:31,066 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2018-11-23 10:47:31,066 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-23 10:47:31,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:31,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:31,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:31,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:47:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 10:47:31,070 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2018-11-23 10:47:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:31,070 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 10:47:31,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:47:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 10:47:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:47:31,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:31,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:31,074 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:31,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash -914412998, now seen corresponding path program 1 times [2018-11-23 10:47:31,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:31,075 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:47:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:31,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:31,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {1115#true} call ULTIMATE.init(); {1115#true} is VALID [2018-11-23 10:47:31,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {1115#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1115#true} is VALID [2018-11-23 10:47:31,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {1115#true} assume true; {1115#true} is VALID [2018-11-23 10:47:31,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1115#true} {1115#true} #125#return; {1115#true} is VALID [2018-11-23 10:47:31,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {1115#true} call #t~ret2 := main(); {1115#true} is VALID [2018-11-23 10:47:31,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {1115#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1135#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:31,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {1135#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1135#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:31,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {1135#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1135#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:31,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {1135#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1145#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:31,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {1145#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {1116#false} is VALID [2018-11-23 10:47:31,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {1116#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1116#false} is VALID [2018-11-23 10:47:31,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {1116#false} assume !~bvslt32(~k~0, ~p~0); {1116#false} is VALID [2018-11-23 10:47:31,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {1116#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1116#false} is VALID [2018-11-23 10:47:31,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {1116#false} assume !~bvslt32(~j~0, ~n~0); {1116#false} is VALID [2018-11-23 10:47:31,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {1116#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1116#false} is VALID [2018-11-23 10:47:31,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#false} assume !~bvslt32(~i~0, ~m~0); {1116#false} is VALID [2018-11-23 10:47:31,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {1116#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1116#false} is VALID [2018-11-23 10:47:31,255 INFO L273 TraceCheckUtils]: 17: Hoare triple {1116#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1116#false} is VALID [2018-11-23 10:47:31,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {1116#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1116#false} is VALID [2018-11-23 10:47:31,256 INFO L273 TraceCheckUtils]: 19: Hoare triple {1116#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1116#false} is VALID [2018-11-23 10:47:31,257 INFO L273 TraceCheckUtils]: 20: Hoare triple {1116#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1116#false} is VALID [2018-11-23 10:47:31,257 INFO L256 TraceCheckUtils]: 21: Hoare triple {1116#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1116#false} is VALID [2018-11-23 10:47:31,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {1116#false} ~cond := #in~cond; {1116#false} is VALID [2018-11-23 10:47:31,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {1116#false} assume 0bv32 == ~cond; {1116#false} is VALID [2018-11-23 10:47:31,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2018-11-23 10:47:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:31,259 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:31,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:31,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:47:31,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 10:47:31,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:31,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:47:31,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:31,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:47:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:47:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:31,338 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-11-23 10:47:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:32,456 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2018-11-23 10:47:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:47:32,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 10:47:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 10:47:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-23 10:47:32,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-23 10:47:32,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:32,820 INFO L225 Difference]: With dead ends: 66 [2018-11-23 10:47:32,820 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 10:47:32,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 10:47:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 10:47:32,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:32,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-23 10:47:32,936 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-23 10:47:32,936 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-23 10:47:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:32,939 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 10:47:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 10:47:32,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:32,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:32,940 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-23 10:47:32,941 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-23 10:47:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:32,943 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-23 10:47:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 10:47:32,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:32,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:32,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:32,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:47:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 10:47:32,947 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 25 [2018-11-23 10:47:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:32,947 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 10:47:32,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:47:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 10:47:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:47:32,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:32,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:32,949 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:32,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2078217125, now seen corresponding path program 1 times [2018-11-23 10:47:32,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:32,950 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:47:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:33,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:33,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {1431#true} call ULTIMATE.init(); {1431#true} is VALID [2018-11-23 10:47:33,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {1431#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1431#true} is VALID [2018-11-23 10:47:33,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-23 10:47:33,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1431#true} {1431#true} #125#return; {1431#true} is VALID [2018-11-23 10:47:33,120 INFO L256 TraceCheckUtils]: 4: Hoare triple {1431#true} call #t~ret2 := main(); {1431#true} is VALID [2018-11-23 10:47:33,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {1431#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1451#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:33,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {1451#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1451#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:33,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {1451#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1451#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:33,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {1451#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1461#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:33,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {1461#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1465#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:33,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {1465#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {1432#false} is VALID [2018-11-23 10:47:33,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1432#false} is VALID [2018-11-23 10:47:33,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {1432#false} assume !~bvslt32(~k~0, ~p~0); {1432#false} is VALID [2018-11-23 10:47:33,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {1432#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1432#false} is VALID [2018-11-23 10:47:33,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {1432#false} assume !~bvslt32(~j~0, ~n~0); {1432#false} is VALID [2018-11-23 10:47:33,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {1432#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1432#false} is VALID [2018-11-23 10:47:33,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {1432#false} assume !~bvslt32(~i~0, ~m~0); {1432#false} is VALID [2018-11-23 10:47:33,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {1432#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {1432#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {1432#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {1432#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {1432#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1432#false} is VALID [2018-11-23 10:47:33,158 INFO L256 TraceCheckUtils]: 22: Hoare triple {1432#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1432#false} is VALID [2018-11-23 10:47:33,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {1432#false} ~cond := #in~cond; {1432#false} is VALID [2018-11-23 10:47:33,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {1432#false} assume 0bv32 == ~cond; {1432#false} is VALID [2018-11-23 10:47:33,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2018-11-23 10:47:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:33,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:33,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {1432#false} assume !false; {1432#false} is VALID [2018-11-23 10:47:33,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {1432#false} assume 0bv32 == ~cond; {1432#false} is VALID [2018-11-23 10:47:33,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {1432#false} ~cond := #in~cond; {1432#false} is VALID [2018-11-23 10:47:33,283 INFO L256 TraceCheckUtils]: 22: Hoare triple {1432#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1432#false} is VALID [2018-11-23 10:47:33,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {1432#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1432#false} is VALID [2018-11-23 10:47:33,284 INFO L273 TraceCheckUtils]: 20: Hoare triple {1432#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,284 INFO L273 TraceCheckUtils]: 19: Hoare triple {1432#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {1432#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {1432#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1432#false} is VALID [2018-11-23 10:47:33,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {1432#false} assume !~bvslt32(~i~0, ~m~0); {1432#false} is VALID [2018-11-23 10:47:33,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {1432#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1432#false} is VALID [2018-11-23 10:47:33,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {1432#false} assume !~bvslt32(~j~0, ~n~0); {1432#false} is VALID [2018-11-23 10:47:33,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {1432#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1432#false} is VALID [2018-11-23 10:47:33,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {1432#false} assume !~bvslt32(~k~0, ~p~0); {1432#false} is VALID [2018-11-23 10:47:33,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1432#false} is VALID [2018-11-23 10:47:33,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {1559#(bvslt main_~l~0 main_~q~0)} assume !~bvslt32(~l~0, ~q~0); {1432#false} is VALID [2018-11-23 10:47:33,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {1563#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1559#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-23 10:47:33,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {1567#(bvslt (_ bv1 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1563#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-23 10:47:33,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {1567#(bvslt (_ bv1 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1567#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-23 10:47:33,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {1567#(bvslt (_ bv1 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1567#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-23 10:47:33,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {1431#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1567#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-23 10:47:33,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {1431#true} call #t~ret2 := main(); {1431#true} is VALID [2018-11-23 10:47:33,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1431#true} {1431#true} #125#return; {1431#true} is VALID [2018-11-23 10:47:33,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {1431#true} assume true; {1431#true} is VALID [2018-11-23 10:47:33,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {1431#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1431#true} is VALID [2018-11-23 10:47:33,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1431#true} call ULTIMATE.init(); {1431#true} is VALID [2018-11-23 10:47:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:33,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:47:33,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 10:47:33,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:33,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:47:33,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:33,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:47:33,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:47:33,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:47:33,465 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 8 states. [2018-11-23 10:47:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:36,876 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2018-11-23 10:47:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:47:36,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 10:47:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:47:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-23 10:47:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:47:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2018-11-23 10:47:36,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2018-11-23 10:47:37,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:37,603 INFO L225 Difference]: With dead ends: 78 [2018-11-23 10:47:37,603 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 10:47:37,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:47:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 10:47:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-23 10:47:37,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:37,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-23 10:47:37,818 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-23 10:47:37,818 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-23 10:47:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:37,822 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-23 10:47:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 10:47:37,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:37,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:37,823 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-23 10:47:37,824 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-23 10:47:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:37,827 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-23 10:47:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-23 10:47:37,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:37,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:37,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:37,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:47:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 10:47:37,831 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 26 [2018-11-23 10:47:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:37,832 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 10:47:37,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:47:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 10:47:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:47:37,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:37,833 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:37,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:37,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1457761530, now seen corresponding path program 2 times [2018-11-23 10:47:37,834 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:37,834 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:47:37,864 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:47:38,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:47:38,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:47:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:38,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:38,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {1899#true} call ULTIMATE.init(); {1899#true} is VALID [2018-11-23 10:47:38,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {1899#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1899#true} is VALID [2018-11-23 10:47:38,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 10:47:38,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1899#true} {1899#true} #125#return; {1899#true} is VALID [2018-11-23 10:47:38,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {1899#true} call #t~ret2 := main(); {1899#true} is VALID [2018-11-23 10:47:38,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {1899#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1919#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:38,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {1919#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1919#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:38,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {1919#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1919#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:47:38,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {1919#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1929#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:38,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {1929#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1933#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:38,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {1933#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1937#(and (= (bvadd main_~l~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:38,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {1937#(and (= (bvadd main_~l~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1941#(and (= (_ bv3 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:38,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {1941#(and (= (_ bv3 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1945#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:47:38,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {1945#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {1900#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {1900#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1900#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {1900#false} assume !~bvslt32(~k~0, ~p~0); {1900#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {1900#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1900#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {1900#false} assume !~bvslt32(~j~0, ~n~0); {1900#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1900#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#false} assume !~bvslt32(~i~0, ~m~0); {1900#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {1900#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {1900#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {1900#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {1900#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {1900#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1900#false} is VALID [2018-11-23 10:47:38,533 INFO L256 TraceCheckUtils]: 25: Hoare triple {1900#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1900#false} is VALID [2018-11-23 10:47:38,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {1900#false} ~cond := #in~cond; {1900#false} is VALID [2018-11-23 10:47:38,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {1900#false} assume 0bv32 == ~cond; {1900#false} is VALID [2018-11-23 10:47:38,534 INFO L273 TraceCheckUtils]: 28: Hoare triple {1900#false} assume !false; {1900#false} is VALID [2018-11-23 10:47:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:38,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:38,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {1900#false} assume !false; {1900#false} is VALID [2018-11-23 10:47:38,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {1900#false} assume 0bv32 == ~cond; {1900#false} is VALID [2018-11-23 10:47:38,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {1900#false} ~cond := #in~cond; {1900#false} is VALID [2018-11-23 10:47:38,773 INFO L256 TraceCheckUtils]: 25: Hoare triple {1900#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1900#false} is VALID [2018-11-23 10:47:38,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {1900#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1900#false} is VALID [2018-11-23 10:47:38,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {1900#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {1900#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {1900#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {1900#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1900#false} is VALID [2018-11-23 10:47:38,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {1900#false} assume !~bvslt32(~i~0, ~m~0); {1900#false} is VALID [2018-11-23 10:47:38,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {1900#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1900#false} is VALID [2018-11-23 10:47:38,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1900#false} assume !~bvslt32(~j~0, ~n~0); {1900#false} is VALID [2018-11-23 10:47:38,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {1900#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1900#false} is VALID [2018-11-23 10:47:38,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {1900#false} assume !~bvslt32(~k~0, ~p~0); {1900#false} is VALID [2018-11-23 10:47:38,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {1900#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1900#false} is VALID [2018-11-23 10:47:38,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {2039#(bvslt main_~l~0 main_~q~0)} assume !~bvslt32(~l~0, ~q~0); {1900#false} is VALID [2018-11-23 10:47:38,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {2043#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2039#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-23 10:47:38,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {2047#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2043#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-23 10:47:39,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {2051#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2047#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} is VALID [2018-11-23 10:47:39,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {2055#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2051#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} is VALID [2018-11-23 10:47:39,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#(bvslt (_ bv4 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2055#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} is VALID [2018-11-23 10:47:39,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {2059#(bvslt (_ bv4 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2059#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-23 10:47:39,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {2059#(bvslt (_ bv4 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2059#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-23 10:47:39,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {1899#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2059#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-23 10:47:39,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {1899#true} call #t~ret2 := main(); {1899#true} is VALID [2018-11-23 10:47:39,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1899#true} {1899#true} #125#return; {1899#true} is VALID [2018-11-23 10:47:39,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {1899#true} assume true; {1899#true} is VALID [2018-11-23 10:47:39,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {1899#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1899#true} is VALID [2018-11-23 10:47:39,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {1899#true} call ULTIMATE.init(); {1899#true} is VALID [2018-11-23 10:47:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (8)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:47:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:39,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:47:39,511 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 10:47:39,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:39,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:47:40,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:40,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:47:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:47:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:47:40,371 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 14 states. [2018-11-23 10:47:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:55,153 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2018-11-23 10:47:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:47:55,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 10:47:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:47:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-11-23 10:47:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:47:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-11-23 10:47:55,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 131 transitions. [2018-11-23 10:47:56,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:56,407 INFO L225 Difference]: With dead ends: 114 [2018-11-23 10:47:56,407 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 10:47:56,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:47:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 10:47:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 10:47:56,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:56,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 10:47:56,725 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 10:47:56,725 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 10:47:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:56,731 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 10:47:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 10:47:56,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:56,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:56,732 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 10:47:56,732 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 10:47:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:56,737 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-23 10:47:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-23 10:47:56,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:56,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:56,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:56,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 10:47:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2018-11-23 10:47:56,745 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 29 [2018-11-23 10:47:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:56,746 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-11-23 10:47:56,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:47:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2018-11-23 10:47:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 10:47:56,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:56,747 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:56,747 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:56,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1693621530, now seen corresponding path program 3 times [2018-11-23 10:47:56,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:56,749 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:56,773 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:47:57,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:47:57,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:47:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:57,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:57,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2018-11-23 10:47:57,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {2550#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2550#true} is VALID [2018-11-23 10:47:57,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2018-11-23 10:47:57,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #125#return; {2550#true} is VALID [2018-11-23 10:47:57,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret2 := main(); {2550#true} is VALID [2018-11-23 10:47:57,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~l~0, ~q~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~k~0, ~p~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~j~0 := ~bvadd32(1bv32, ~j~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:57,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {2570#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2628#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:57,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {2628#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {2551#false} is VALID [2018-11-23 10:47:57,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {2551#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {2551#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {2551#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {2551#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {2551#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {2551#false} is VALID [2018-11-23 10:47:57,233 INFO L256 TraceCheckUtils]: 31: Hoare triple {2551#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {2551#false} is VALID [2018-11-23 10:47:57,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2018-11-23 10:47:57,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {2551#false} assume 0bv32 == ~cond; {2551#false} is VALID [2018-11-23 10:47:57,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2018-11-23 10:47:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 10:47:57,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:57,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2018-11-23 10:47:57,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2551#false} assume 0bv32 == ~cond; {2551#false} is VALID [2018-11-23 10:47:57,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {2551#false} ~cond := #in~cond; {2551#false} is VALID [2018-11-23 10:47:57,393 INFO L256 TraceCheckUtils]: 31: Hoare triple {2551#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {2551#false} is VALID [2018-11-23 10:47:57,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {2551#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {2551#false} is VALID [2018-11-23 10:47:57,394 INFO L273 TraceCheckUtils]: 29: Hoare triple {2551#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {2551#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,394 INFO L273 TraceCheckUtils]: 27: Hoare triple {2551#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,394 INFO L273 TraceCheckUtils]: 26: Hoare triple {2551#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2551#false} is VALID [2018-11-23 10:47:57,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {2686#(bvslt main_~i~0 main_~m~0)} assume !~bvslt32(~i~0, ~m~0); {2551#false} is VALID [2018-11-23 10:47:57,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {2686#(bvslt main_~i~0 main_~m~0)} is VALID [2018-11-23 10:47:57,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~j~0, ~n~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~j~0 := ~bvadd32(1bv32, ~j~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~k~0, ~p~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~l~0, ~q~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2690#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-23 10:47:57,444 INFO L256 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret2 := main(); {2550#true} is VALID [2018-11-23 10:47:57,444 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #125#return; {2550#true} is VALID [2018-11-23 10:47:57,444 INFO L273 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2018-11-23 10:47:57,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {2550#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2550#true} is VALID [2018-11-23 10:47:57,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2018-11-23 10:47:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 10:47:57,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:57,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:47:57,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-23 10:47:57,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:57,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:47:57,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:47:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:47:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:47:57,680 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 6 states. [2018-11-23 10:48:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:48:00,208 INFO L93 Difference]: Finished difference Result 175 states and 215 transitions. [2018-11-23 10:48:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:48:00,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-23 10:48:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:48:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:48:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 10:48:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:48:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 10:48:00,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-23 10:48:00,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:48:00,646 INFO L225 Difference]: With dead ends: 175 [2018-11-23 10:48:00,646 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 10:48:00,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:48:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 10:48:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-23 10:48:01,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:48:01,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 129 states. [2018-11-23 10:48:01,489 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 129 states. [2018-11-23 10:48:01,489 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 129 states. [2018-11-23 10:48:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:48:01,495 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2018-11-23 10:48:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2018-11-23 10:48:01,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:48:01,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:48:01,496 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 129 states. [2018-11-23 10:48:01,497 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 129 states. [2018-11-23 10:48:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:48:01,502 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2018-11-23 10:48:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2018-11-23 10:48:01,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:48:01,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:48:01,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:48:01,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:48:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 10:48:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 154 transitions. [2018-11-23 10:48:01,508 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 154 transitions. Word has length 35 [2018-11-23 10:48:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:48:01,509 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 154 transitions. [2018-11-23 10:48:01,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:48:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 154 transitions. [2018-11-23 10:48:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 10:48:01,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:48:01,511 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:48:01,511 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:48:01,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:48:01,512 INFO L82 PathProgramCache]: Analyzing trace with hash 844645786, now seen corresponding path program 4 times [2018-11-23 10:48:01,513 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:48:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:48:01,534 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:48:01,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:48:01,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:48:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:48:01,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:48:02,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {3548#true} call ULTIMATE.init(); {3548#true} is VALID [2018-11-23 10:48:02,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {3548#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3548#true} is VALID [2018-11-23 10:48:02,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {3548#true} assume true; {3548#true} is VALID [2018-11-23 10:48:02,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3548#true} {3548#true} #125#return; {3548#true} is VALID [2018-11-23 10:48:02,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {3548#true} call #t~ret2 := main(); {3548#true} is VALID [2018-11-23 10:48:02,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {3548#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3568#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:48:02,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {3568#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3568#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:48:02,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {3568#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3568#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-23 10:48:02,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {3568#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3578#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {3578#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3582#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {3582#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3586#(and (= (_ bv2 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {3586#(and (= (_ bv2 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3590#(and (= (bvadd main_~l~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {3590#(and (= (bvadd main_~l~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3594#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {3594#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3598#(and (= (bvadd main_~l~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {3598#(and (= (bvadd main_~l~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3602#(and (= (bvadd main_~l~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {3602#(and (= (bvadd main_~l~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3606#(and (= (bvadd main_~l~0 (_ bv4294967289 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {3606#(and (= (bvadd main_~l~0 (_ bv4294967289 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3610#(and (= (bvadd main_~l~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {3610#(and (= (bvadd main_~l~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3614#(and (= (_ bv9 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {3614#(and (= (_ bv9 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3618#(and (= (bvadd main_~l~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-23 10:48:02,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {3618#(and (= (bvadd main_~l~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:02,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:02,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:02,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:02,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:02,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:02,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,518 INFO L273 TraceCheckUtils]: 28: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,518 INFO L273 TraceCheckUtils]: 31: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,519 INFO L273 TraceCheckUtils]: 33: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,519 INFO L273 TraceCheckUtils]: 35: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,519 INFO L273 TraceCheckUtils]: 36: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,519 INFO L273 TraceCheckUtils]: 37: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,520 INFO L273 TraceCheckUtils]: 38: Hoare triple {3549#false} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:02,520 INFO L273 TraceCheckUtils]: 39: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:02,520 INFO L273 TraceCheckUtils]: 40: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:02,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:02,521 INFO L273 TraceCheckUtils]: 42: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:02,521 INFO L273 TraceCheckUtils]: 43: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:02,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,522 INFO L273 TraceCheckUtils]: 49: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,522 INFO L273 TraceCheckUtils]: 50: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,522 INFO L273 TraceCheckUtils]: 51: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 56: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 57: Hoare triple {3549#false} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 58: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:02,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:02,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:02,524 INFO L273 TraceCheckUtils]: 61: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:02,524 INFO L273 TraceCheckUtils]: 62: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:02,524 INFO L273 TraceCheckUtils]: 63: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,524 INFO L273 TraceCheckUtils]: 64: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,525 INFO L273 TraceCheckUtils]: 66: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,525 INFO L273 TraceCheckUtils]: 67: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,525 INFO L273 TraceCheckUtils]: 68: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,525 INFO L273 TraceCheckUtils]: 69: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,525 INFO L273 TraceCheckUtils]: 70: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,526 INFO L273 TraceCheckUtils]: 71: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,526 INFO L273 TraceCheckUtils]: 72: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,526 INFO L273 TraceCheckUtils]: 73: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,526 INFO L273 TraceCheckUtils]: 74: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,526 INFO L273 TraceCheckUtils]: 75: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:02,527 INFO L273 TraceCheckUtils]: 76: Hoare triple {3549#false} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:02,527 INFO L273 TraceCheckUtils]: 77: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:02,527 INFO L273 TraceCheckUtils]: 78: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:02,527 INFO L273 TraceCheckUtils]: 79: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:02,527 INFO L273 TraceCheckUtils]: 80: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:02,528 INFO L273 TraceCheckUtils]: 81: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:02,528 INFO L273 TraceCheckUtils]: 82: Hoare triple {3549#false} assume !~bvslt32(~i~0, ~m~0); {3549#false} is VALID [2018-11-23 10:48:02,528 INFO L273 TraceCheckUtils]: 83: Hoare triple {3549#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,528 INFO L273 TraceCheckUtils]: 84: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,529 INFO L273 TraceCheckUtils]: 86: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:02,529 INFO L273 TraceCheckUtils]: 87: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {3549#false} is VALID [2018-11-23 10:48:02,529 INFO L256 TraceCheckUtils]: 88: Hoare triple {3549#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {3549#false} is VALID [2018-11-23 10:48:02,529 INFO L273 TraceCheckUtils]: 89: Hoare triple {3549#false} ~cond := #in~cond; {3549#false} is VALID [2018-11-23 10:48:02,529 INFO L273 TraceCheckUtils]: 90: Hoare triple {3549#false} assume 0bv32 == ~cond; {3549#false} is VALID [2018-11-23 10:48:02,530 INFO L273 TraceCheckUtils]: 91: Hoare triple {3549#false} assume !false; {3549#false} is VALID [2018-11-23 10:48:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 381 proven. 55 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-11-23 10:48:02,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:48:03,262 INFO L273 TraceCheckUtils]: 91: Hoare triple {3549#false} assume !false; {3549#false} is VALID [2018-11-23 10:48:03,262 INFO L273 TraceCheckUtils]: 90: Hoare triple {3549#false} assume 0bv32 == ~cond; {3549#false} is VALID [2018-11-23 10:48:03,262 INFO L273 TraceCheckUtils]: 89: Hoare triple {3549#false} ~cond := #in~cond; {3549#false} is VALID [2018-11-23 10:48:03,263 INFO L256 TraceCheckUtils]: 88: Hoare triple {3549#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {3549#false} is VALID [2018-11-23 10:48:03,263 INFO L273 TraceCheckUtils]: 87: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {3549#false} is VALID [2018-11-23 10:48:03,263 INFO L273 TraceCheckUtils]: 86: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,263 INFO L273 TraceCheckUtils]: 84: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,263 INFO L273 TraceCheckUtils]: 83: Hoare triple {3549#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,264 INFO L273 TraceCheckUtils]: 82: Hoare triple {3549#false} assume !~bvslt32(~i~0, ~m~0); {3549#false} is VALID [2018-11-23 10:48:03,264 INFO L273 TraceCheckUtils]: 81: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:03,264 INFO L273 TraceCheckUtils]: 80: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:03,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:03,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:03,265 INFO L273 TraceCheckUtils]: 77: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:03,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {3549#false} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:03,265 INFO L273 TraceCheckUtils]: 75: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,265 INFO L273 TraceCheckUtils]: 74: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,266 INFO L273 TraceCheckUtils]: 73: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,266 INFO L273 TraceCheckUtils]: 71: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,266 INFO L273 TraceCheckUtils]: 70: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,267 INFO L273 TraceCheckUtils]: 69: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,267 INFO L273 TraceCheckUtils]: 68: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,267 INFO L273 TraceCheckUtils]: 67: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,268 INFO L273 TraceCheckUtils]: 65: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,268 INFO L273 TraceCheckUtils]: 64: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,268 INFO L273 TraceCheckUtils]: 63: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,268 INFO L273 TraceCheckUtils]: 62: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:03,269 INFO L273 TraceCheckUtils]: 61: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:03,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:03,269 INFO L273 TraceCheckUtils]: 59: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:03,269 INFO L273 TraceCheckUtils]: 58: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:03,269 INFO L273 TraceCheckUtils]: 57: Hoare triple {3549#false} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:03,270 INFO L273 TraceCheckUtils]: 56: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,270 INFO L273 TraceCheckUtils]: 55: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,271 INFO L273 TraceCheckUtils]: 52: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,271 INFO L273 TraceCheckUtils]: 51: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,271 INFO L273 TraceCheckUtils]: 50: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,271 INFO L273 TraceCheckUtils]: 49: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,272 INFO L273 TraceCheckUtils]: 46: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,273 INFO L273 TraceCheckUtils]: 43: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:03,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:03,273 INFO L273 TraceCheckUtils]: 41: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:03,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:03,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:03,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {3549#false} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:03,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {3549#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3549#false} is VALID [2018-11-23 10:48:03,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {3549#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {3549#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,277 INFO L273 TraceCheckUtils]: 25: Hoare triple {3549#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3549#false} is VALID [2018-11-23 10:48:03,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {3549#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3549#false} is VALID [2018-11-23 10:48:03,277 INFO L273 TraceCheckUtils]: 23: Hoare triple {3549#false} assume !~bvslt32(~j~0, ~n~0); {3549#false} is VALID [2018-11-23 10:48:03,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {3549#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {3549#false} is VALID [2018-11-23 10:48:03,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {3549#false} assume !~bvslt32(~k~0, ~p~0); {3549#false} is VALID [2018-11-23 10:48:03,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {3549#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {3549#false} is VALID [2018-11-23 10:48:03,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {4054#(bvslt main_~l~0 main_~q~0)} assume !~bvslt32(~l~0, ~q~0); {3549#false} is VALID [2018-11-23 10:48:03,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {4058#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4054#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-23 10:48:03,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {4062#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4058#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-23 10:48:03,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {4066#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4062#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} is VALID [2018-11-23 10:48:04,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {4070#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4066#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} is VALID [2018-11-23 10:48:04,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {4074#(bvslt (bvadd main_~l~0 (_ bv5 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4070#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} is VALID [2018-11-23 10:48:04,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {4078#(bvslt (bvadd main_~l~0 (_ bv6 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4074#(bvslt (bvadd main_~l~0 (_ bv5 32)) main_~q~0)} is VALID [2018-11-23 10:48:04,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {4082#(bvslt (bvadd main_~l~0 (_ bv7 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4078#(bvslt (bvadd main_~l~0 (_ bv6 32)) main_~q~0)} is VALID [2018-11-23 10:48:04,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {4086#(bvslt (bvadd main_~l~0 (_ bv8 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4082#(bvslt (bvadd main_~l~0 (_ bv7 32)) main_~q~0)} is VALID [2018-11-23 10:48:05,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {4090#(bvslt (bvadd main_~l~0 (_ bv9 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4086#(bvslt (bvadd main_~l~0 (_ bv8 32)) main_~q~0)} is VALID [2018-11-23 10:48:05,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {4094#(bvslt (bvadd main_~l~0 (_ bv10 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4090#(bvslt (bvadd main_~l~0 (_ bv9 32)) main_~q~0)} is VALID [2018-11-23 10:48:05,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {4098#(bvslt (_ bv10 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4094#(bvslt (bvadd main_~l~0 (_ bv10 32)) main_~q~0)} is VALID [2018-11-23 10:48:05,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {4098#(bvslt (_ bv10 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4098#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-23 10:48:05,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {4098#(bvslt (_ bv10 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4098#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-23 10:48:05,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {3548#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4098#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-23 10:48:05,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {3548#true} call #t~ret2 := main(); {3548#true} is VALID [2018-11-23 10:48:05,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3548#true} {3548#true} #125#return; {3548#true} is VALID [2018-11-23 10:48:05,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {3548#true} assume true; {3548#true} is VALID [2018-11-23 10:48:05,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {3548#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3548#true} is VALID [2018-11-23 10:48:05,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {3548#true} call ULTIMATE.init(); {3548#true} is VALID [2018-11-23 10:48:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 381 proven. 55 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-11-23 10:48:05,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:48:05,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 10:48:05,389 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-11-23 10:48:05,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:48:05,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:48:07,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:48:07,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:48:07,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:48:07,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:48:07,301 INFO L87 Difference]: Start difference. First operand 129 states and 154 transitions. Second operand 26 states. [2018-11-23 10:49:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:49:09,598 INFO L93 Difference]: Finished difference Result 335 states and 457 transitions. [2018-11-23 10:49:09,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 10:49:09,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-11-23 10:49:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:49:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:49:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 203 transitions. [2018-11-23 10:49:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:49:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 203 transitions. [2018-11-23 10:49:09,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 203 transitions. [2018-11-23 10:49:12,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:49:12,057 INFO L225 Difference]: With dead ends: 335 [2018-11-23 10:49:12,057 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 10:49:12,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:49:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 10:49:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-11-23 10:49:13,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:49:13,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 213 states. [2018-11-23 10:49:13,693 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 213 states. [2018-11-23 10:49:13,694 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 213 states. [2018-11-23 10:49:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:49:13,704 INFO L93 Difference]: Finished difference Result 214 states and 251 transitions. [2018-11-23 10:49:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2018-11-23 10:49:13,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:49:13,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:49:13,705 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 214 states. [2018-11-23 10:49:13,706 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 214 states. [2018-11-23 10:49:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:49:13,713 INFO L93 Difference]: Finished difference Result 214 states and 251 transitions. [2018-11-23 10:49:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2018-11-23 10:49:13,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:49:13,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:49:13,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:49:13,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:49:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-23 10:49:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 250 transitions. [2018-11-23 10:49:13,723 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 250 transitions. Word has length 92 [2018-11-23 10:49:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:49:13,723 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 250 transitions. [2018-11-23 10:49:13,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 10:49:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 250 transitions. [2018-11-23 10:49:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 10:49:13,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:49:13,725 INFO L402 BasicCegarLoop]: trace histogram [88, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:49:13,726 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:49:13,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:49:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1804683878, now seen corresponding path program 5 times [2018-11-23 10:49:13,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:49:13,728 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:49:13,755 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1