java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:48,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:48,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:48,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:48,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:48,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:48,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:48,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:48,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:48,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:48,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:48,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:48,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:48,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:48,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:48,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:48,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:48,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:48,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:48,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:48,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:48,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:48,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:48,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:48,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:48,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:48,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:48,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:48,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:48,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:48,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:48,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:48,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:48,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:48,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:48,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:48,088 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:13:48,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:48,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:48,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:48,121 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:48,122 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:48,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:48,122 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:48,123 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:48,123 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:48,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:48,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:48,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:48,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:48,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:48,125 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:48,125 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:48,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:48,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:48,126 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:48,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:48,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:48,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:48,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:48,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:48,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:48,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:48,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:48,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:48,129 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:48,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:48,130 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:48,130 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:48,130 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:48,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:48,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:48,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:48,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:48,225 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:48,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i [2018-11-23 10:13:48,293 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea42cf1b/37fecd0ecf0b49618f9a5566497b83ab/FLAG884e56f3e [2018-11-23 10:13:48,788 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:48,788 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_09_true-unreach-call.i [2018-11-23 10:13:48,796 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea42cf1b/37fecd0ecf0b49618f9a5566497b83ab/FLAG884e56f3e [2018-11-23 10:13:49,090 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea42cf1b/37fecd0ecf0b49618f9a5566497b83ab [2018-11-23 10:13:49,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:49,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:49,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:49,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:49,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:49,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703a52da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49, skipping insertion in model container [2018-11-23 10:13:49,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:49,153 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:49,382 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:49,388 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:49,423 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:49,449 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:49,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49 WrapperNode [2018-11-23 10:13:49,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:49,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:49,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:49,451 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:49,462 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:13:49" (1/1) ... [2018-11-23 10:13:49,475 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:13:49" (1/1) ... [2018-11-23 10:13:49,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:49,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:49,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:49,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:49,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... [2018-11-23 10:13:49,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:49,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:49,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:49,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:49,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:49,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:49,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:49,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:49,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:50,205 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:50,205 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:13:50,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:50 BoogieIcfgContainer [2018-11-23 10:13:50,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:50,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:50,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:50,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:49" (1/3) ... [2018-11-23 10:13:50,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f41079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:50, skipping insertion in model container [2018-11-23 10:13:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:49" (2/3) ... [2018-11-23 10:13:50,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f41079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:50, skipping insertion in model container [2018-11-23 10:13:50,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:50" (3/3) ... [2018-11-23 10:13:50,215 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_09_true-unreach-call.i [2018-11-23 10:13:50,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:50,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:50,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:50,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:50,292 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:50,292 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:50,292 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:50,293 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:50,293 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:50,293 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:50,293 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:50,293 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:13:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:50,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:50,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:50,327 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:50,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 10:13:50,339 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:50,340 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:13:50,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:50,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:50,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:13:50,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 10:13:50,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:13:50,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 10:13:50,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 10:13:50,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 10:13:50,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:13:50,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1bv32; {28#false} is VALID [2018-11-23 10:13:50,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !~bvslt32(~i~0, 100000bv32); {28#false} is VALID [2018-11-23 10:13:50,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1bv32;~j~0 := 0bv32; {28#false} is VALID [2018-11-23 10:13:50,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {28#false} is VALID [2018-11-23 10:13:50,592 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:13:50,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:13:50,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:13:50,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:13:50,596 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:13:50,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:50,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:50,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:50,607 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:50,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:50,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:50,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:50,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:50,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:50,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:50,731 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:13:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:51,042 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 10:13:51,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:51,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:51,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 10:13:51,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:51,326 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:13:51,327 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:13:51,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:13:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:13:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:13:51,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:51,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:51,375 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:51,375 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:51,379 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:51,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:51,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:51,380 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:51,380 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:51,385 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:51,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:51,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:51,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:51,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:13:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 10:13:51,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 10:13:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:51,391 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 10:13:51,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:51,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:51,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:51,393 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:51,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:51,393 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 10:13:51,394 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:51,394 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:13:51,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:51,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:51,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 10:13:51,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {193#true} is VALID [2018-11-23 10:13:51,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 10:13:51,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #60#return; {193#true} is VALID [2018-11-23 10:13:51,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 10:13:51,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {213#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:51,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:51,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#false} ~i~0 := 1bv32; {194#false} is VALID [2018-11-23 10:13:51,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#false} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:51,551 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~i~0 := 1bv32;~j~0 := 0bv32; {194#false} is VALID [2018-11-23 10:13:51,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {194#false} is VALID [2018-11-23 10:13:51,551 INFO L256 TraceCheckUtils]: 11: Hoare triple {194#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {194#false} is VALID [2018-11-23 10:13:51,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 10:13:51,552 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#false} assume 0bv32 == ~cond; {194#false} is VALID [2018-11-23 10:13:51,552 INFO L273 TraceCheckUtils]: 14: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 10:13:51,553 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:13:51,554 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:51,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:51,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:51,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:51,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:51,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:51,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:51,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:51,596 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 10:13:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:51,741 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 10:13:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:51,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:51,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:51,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 10:13:52,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:52,158 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:13:52,158 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:13:52,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:13:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:13:52,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:52,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:52,177 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:52,177 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:52,180 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:52,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:52,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:52,180 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:52,181 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:52,183 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:52,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:52,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:52,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:52,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:13:52,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 10:13:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:52,187 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:13:52,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:13:52,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:52,188 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:13:52,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:52,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 10:13:52,189 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:52,190 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:13:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:52,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:52,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:52,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:52,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:52,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:52,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:52,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:52,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:52,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:52,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:52,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:52,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:52,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:52,352 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:52,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:52,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:52,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:52,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:52,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:52,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:52,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:52,622 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:52,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:52,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:52,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:52,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:52,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:52,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {432#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:52,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:52,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:52,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:52,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:52,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:52,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:52,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:52,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:52,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:52,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:52,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:52,818 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:13:52,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:52,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:52,819 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 10:13:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:53,414 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 10:13:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:53,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:53,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 10:13:53,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:53,586 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:13:53,586 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:13:53,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:13:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:13:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 10:13:53,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:53,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:53,617 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:53,618 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:53,623 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:53,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:53,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:53,624 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:53,624 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:53,628 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:53,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:53,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:53,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:53,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:13:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 10:13:53,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-23 10:13:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:53,632 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 10:13:53,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 10:13:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:13:53,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:53,633 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:53,634 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:53,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:53,634 INFO L82 PathProgramCache]: Analyzing trace with hash -897319674, now seen corresponding path program 1 times [2018-11-23 10:13:53,635 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:53,635 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:13:53,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:53,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:53,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:53,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:53,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:53,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:53,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:53,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {647#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:53,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {647#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:53,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:53,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:53,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:53,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:53,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:53,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:53,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:53,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:53,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:53,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:53,857 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:53,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:53,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:53,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:53,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:54,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:54,036 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:54,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:54,037 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:54,037 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:54,038 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:54,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:54,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:54,039 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:54,039 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:54,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {727#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:54,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {727#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:54,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:54,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:54,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:54,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:54,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:54,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:54,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:54,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:54,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:54,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:54,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:13:54,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:54,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:54,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:13:54,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:54,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:13:54,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:13:54,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:13:54,125 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-11-23 10:13:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,761 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 10:13:55,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:13:55,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 10:13:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 10:13:55,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-23 10:13:55,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:55,908 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:13:55,908 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:13:55,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:13:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-11-23 10:13:55,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:55,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2018-11-23 10:13:55,935 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2018-11-23 10:13:55,935 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2018-11-23 10:13:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,940 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:13:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:13:55,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:55,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:55,942 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2018-11-23 10:13:55,942 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2018-11-23 10:13:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,945 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:13:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:13:55,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:55,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:55,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:55,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:13:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 10:13:55,948 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-11-23 10:13:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:55,949 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 10:13:55,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:13:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 10:13:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:13:55,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:55,950 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:55,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:55,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -3011962, now seen corresponding path program 2 times [2018-11-23 10:13:55,952 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:55,952 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:13:55,969 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:56,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:56,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:56,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:56,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2018-11-23 10:13:56,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {980#true} is VALID [2018-11-23 10:13:56,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2018-11-23 10:13:56,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #60#return; {980#true} is VALID [2018-11-23 10:13:56,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret4 := main(); {980#true} is VALID [2018-11-23 10:13:56,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {980#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {980#true} is VALID [2018-11-23 10:13:56,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#true} assume !~bvslt32(~i~0, 100000bv32); {980#true} is VALID [2018-11-23 10:13:56,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#true} ~i~0 := 1bv32; {1036#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {1036#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1040#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {1040#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1044#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {1044#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {981#false} is VALID [2018-11-23 10:13:56,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {981#false} ~i~0 := 1bv32;~j~0 := 0bv32; {981#false} is VALID [2018-11-23 10:13:56,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {981#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {981#false} is VALID [2018-11-23 10:13:56,156 INFO L256 TraceCheckUtils]: 23: Hoare triple {981#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {981#false} is VALID [2018-11-23 10:13:56,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2018-11-23 10:13:56,156 INFO L273 TraceCheckUtils]: 25: Hoare triple {981#false} assume 0bv32 == ~cond; {981#false} is VALID [2018-11-23 10:13:56,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {981#false} assume !false; {981#false} is VALID [2018-11-23 10:13:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:56,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:56,236 INFO L273 TraceCheckUtils]: 26: Hoare triple {981#false} assume !false; {981#false} is VALID [2018-11-23 10:13:56,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {981#false} assume 0bv32 == ~cond; {981#false} is VALID [2018-11-23 10:13:56,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2018-11-23 10:13:56,237 INFO L256 TraceCheckUtils]: 23: Hoare triple {981#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {981#false} is VALID [2018-11-23 10:13:56,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {981#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {981#false} is VALID [2018-11-23 10:13:56,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {981#false} ~i~0 := 1bv32;~j~0 := 0bv32; {981#false} is VALID [2018-11-23 10:13:56,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {1084#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {981#false} is VALID [2018-11-23 10:13:56,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {1088#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1084#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:56,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1092#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1088#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#true} ~i~0 := 1bv32; {1092#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#true} assume !~bvslt32(~i~0, 100000bv32); {980#true} is VALID [2018-11-23 10:13:56,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:56,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {980#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {980#true} is VALID [2018-11-23 10:13:56,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret4 := main(); {980#true} is VALID [2018-11-23 10:13:56,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #60#return; {980#true} is VALID [2018-11-23 10:13:56,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2018-11-23 10:13:56,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {980#true} is VALID [2018-11-23 10:13:56,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2018-11-23 10:13:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:56,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:56,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:13:56,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 10:13:56,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:56,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:13:56,305 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:13:56,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:13:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:13:56,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:13:56,306 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-11-23 10:13:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,245 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 10:13:57,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:13:57,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 10:13:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:13:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 10:13:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:13:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 10:13:57,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2018-11-23 10:13:57,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:57,402 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:13:57,403 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 10:13:57,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:13:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 10:13:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-23 10:13:57,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:57,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 35 states. [2018-11-23 10:13:57,453 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 35 states. [2018-11-23 10:13:57,453 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 35 states. [2018-11-23 10:13:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,457 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 10:13:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 10:13:57,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:57,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:57,458 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 51 states. [2018-11-23 10:13:57,458 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 51 states. [2018-11-23 10:13:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,462 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 10:13:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 10:13:57,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:57,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:57,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:57,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 10:13:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 10:13:57,466 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2018-11-23 10:13:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:57,466 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 10:13:57,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:13:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 10:13:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:13:57,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:57,468 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:57,468 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:57,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:57,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1389169850, now seen corresponding path program 3 times [2018-11-23 10:13:57,469 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:57,469 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:13:57,499 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:13:57,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:13:57,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:57,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:58,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 10:13:58,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 10:13:58,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 10:13:58,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #60#return; {1417#true} is VALID [2018-11-23 10:13:58,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret4 := main(); {1417#true} is VALID [2018-11-23 10:13:58,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1417#true} is VALID [2018-11-23 10:13:58,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,141 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,141 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {1417#true} assume !~bvslt32(~i~0, 100000bv32); {1417#true} is VALID [2018-11-23 10:13:58,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {1417#true} ~i~0 := 1bv32; {1473#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:58,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {1473#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1477#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:58,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {1477#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1481#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:13:58,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {1481#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1485#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:58,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {1485#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1489#(= (bvadd main_~i~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:58,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {1489#(= (bvadd main_~i~0 (_ bv4294967259 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1493#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:58,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {1493#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1497#(= (_ bv55 32) main_~i~0)} is VALID [2018-11-23 10:13:58,160 INFO L273 TraceCheckUtils]: 24: Hoare triple {1497#(= (_ bv55 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1418#false} is VALID [2018-11-23 10:13:58,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1418#false} is VALID [2018-11-23 10:13:58,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {1418#false} is VALID [2018-11-23 10:13:58,160 INFO L256 TraceCheckUtils]: 27: Hoare triple {1418#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 10:13:58,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 10:13:58,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 10:13:58,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 10:13:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:58,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:58,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 10:13:58,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 10:13:58,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 10:13:58,411 INFO L256 TraceCheckUtils]: 27: Hoare triple {1418#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 10:13:58,411 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {1418#false} is VALID [2018-11-23 10:13:58,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1418#false} is VALID [2018-11-23 10:13:58,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {1537#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1418#false} is VALID [2018-11-23 10:13:58,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1537#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:58,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {1545#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1541#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {1549#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1545#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {1553#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1549#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1553#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {1561#(bvslt (bvadd main_~i~0 (_ bv54 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1557#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {1417#true} ~i~0 := 1bv32; {1561#(bvslt (bvadd main_~i~0 (_ bv54 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {1417#true} assume !~bvslt32(~i~0, 100000bv32); {1417#true} is VALID [2018-11-23 10:13:58,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,450 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:58,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1417#true} is VALID [2018-11-23 10:13:58,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret4 := main(); {1417#true} is VALID [2018-11-23 10:13:58,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #60#return; {1417#true} is VALID [2018-11-23 10:13:58,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 10:13:58,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 10:13:58,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 10:13:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:58,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:58,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 10:13:58,459 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-23 10:13:58,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:58,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:13:58,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:58,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:13:58,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:13:58,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:58,555 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 16 states. [2018-11-23 10:14:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:02,684 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2018-11-23 10:14:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 10:14:02,684 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-23 10:14:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:14:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2018-11-23 10:14:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:14:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2018-11-23 10:14:02,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2018-11-23 10:14:02,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:02,956 INFO L225 Difference]: With dead ends: 93 [2018-11-23 10:14:02,956 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 10:14:02,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-23 10:14:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 10:14:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 43. [2018-11-23 10:14:03,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:03,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 43 states. [2018-11-23 10:14:03,042 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 43 states. [2018-11-23 10:14:03,042 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 43 states. [2018-11-23 10:14:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:03,049 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 10:14:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2018-11-23 10:14:03,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:03,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:03,051 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 83 states. [2018-11-23 10:14:03,051 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 83 states. [2018-11-23 10:14:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:03,056 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 10:14:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2018-11-23 10:14:03,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:03,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:03,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:03,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:14:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 10:14:03,060 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 31 [2018-11-23 10:14:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:03,060 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 10:14:03,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:14:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 10:14:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 10:14:03,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:03,061 INFO L402 BasicCegarLoop]: trace histogram [14, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:03,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:03,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -4348730, now seen corresponding path program 4 times [2018-11-23 10:14:03,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:03,063 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:14:03,097 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:14:03,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:14:03,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:14:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:14:03,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:14:03,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2034#true} is VALID [2018-11-23 10:14:03,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {2034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2034#true} is VALID [2018-11-23 10:14:03,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2018-11-23 10:14:03,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #60#return; {2034#true} is VALID [2018-11-23 10:14:03,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret4 := main(); {2034#true} is VALID [2018-11-23 10:14:03,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {2034#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2054#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:14:03,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {2054#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2058#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {2058#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2062#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {2062#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2066#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {2066#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2070#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {2070#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2074#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {2074#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2078#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:14:03,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {2078#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2082#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {2082#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2086#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:14:03,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {2086#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2090#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {2090#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2094#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {2094#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:14:03,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {2035#false} ~i~0 := 1bv32; {2035#false} is VALID [2018-11-23 10:14:03,651 INFO L273 TraceCheckUtils]: 18: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,653 INFO L273 TraceCheckUtils]: 24: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,654 INFO L273 TraceCheckUtils]: 27: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,654 INFO L273 TraceCheckUtils]: 31: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:03,654 INFO L273 TraceCheckUtils]: 32: Hoare triple {2035#false} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:14:03,655 INFO L273 TraceCheckUtils]: 33: Hoare triple {2035#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2035#false} is VALID [2018-11-23 10:14:03,655 INFO L273 TraceCheckUtils]: 34: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {2035#false} is VALID [2018-11-23 10:14:03,655 INFO L256 TraceCheckUtils]: 35: Hoare triple {2035#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2035#false} is VALID [2018-11-23 10:14:03,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {2035#false} ~cond := #in~cond; {2035#false} is VALID [2018-11-23 10:14:03,656 INFO L273 TraceCheckUtils]: 37: Hoare triple {2035#false} assume 0bv32 == ~cond; {2035#false} is VALID [2018-11-23 10:14:03,656 INFO L273 TraceCheckUtils]: 38: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2018-11-23 10:14:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:14:03,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:14:04,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2018-11-23 10:14:04,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {2035#false} assume 0bv32 == ~cond; {2035#false} is VALID [2018-11-23 10:14:04,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {2035#false} ~cond := #in~cond; {2035#false} is VALID [2018-11-23 10:14:04,132 INFO L256 TraceCheckUtils]: 35: Hoare triple {2035#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(9bv32, ~j~0)))), 4bv32); {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {2035#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {2035#false} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 29: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,133 INFO L273 TraceCheckUtils]: 28: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(9bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:14:04,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {2035#false} ~i~0 := 1bv32; {2035#false} is VALID [2018-11-23 10:14:04,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:14:04,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {2234#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2230#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:14:04,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {2238#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2234#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {2242#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2238#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {2246#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2242#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {2250#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2246#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {2254#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2250#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {2258#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2254#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {2262#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2258#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {2266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2262#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {2270#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {2034#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2270#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret4 := main(); {2034#true} is VALID [2018-11-23 10:14:04,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #60#return; {2034#true} is VALID [2018-11-23 10:14:04,187 INFO L273 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2018-11-23 10:14:04,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {2034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2034#true} is VALID [2018-11-23 10:14:04,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2034#true} is VALID [2018-11-23 10:14:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:14:04,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:14:04,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:14:04,197 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-23 10:14:04,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:14:04,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:14:04,291 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:14:04,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:14:04,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:14:04,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:14:04,292 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 24 states. [2018-11-23 10:14:05,826 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 7 [2018-11-23 10:14:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:08,638 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-11-23 10:14:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:14:08,638 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-23 10:14:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 10:14:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 10:14:08,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 88 transitions. [2018-11-23 10:14:08,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:08,908 INFO L225 Difference]: With dead ends: 93 [2018-11-23 10:14:08,908 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 10:14:08,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:14:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 10:14:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-11-23 10:14:08,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:08,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 55 states. [2018-11-23 10:14:08,964 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 55 states. [2018-11-23 10:14:08,964 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 55 states. [2018-11-23 10:14:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:08,967 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 10:14:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-23 10:14:08,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:08,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:08,968 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 67 states. [2018-11-23 10:14:08,968 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 67 states. [2018-11-23 10:14:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:08,971 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 10:14:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-23 10:14:08,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:08,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:08,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:08,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 10:14:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 10:14:08,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 39 [2018-11-23 10:14:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:08,975 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 10:14:08,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:14:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 10:14:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 10:14:08,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:08,976 INFO L402 BasicCegarLoop]: trace histogram [22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:08,977 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:08,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1896931270, now seen corresponding path program 5 times [2018-11-23 10:14:08,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:08,978 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:14:09,000 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1