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_init2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:28,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:28,865 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:28,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:28,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:28,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:28,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:28,888 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:28,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:28,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:28,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:28,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:28,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:28,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:28,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:28,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:28,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:28,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:28,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:28,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:28,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:28,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:28,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:28,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:28,927 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:28,928 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:28,929 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:28,930 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:28,932 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:28,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:28,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:28,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:28,935 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:28,935 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:28,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:28,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:28,937 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:58:28,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:28,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:28,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:28,958 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:28,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:28,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:28,959 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:28,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:28,960 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:28,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:28,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:28,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:28,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:28,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:28,961 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:28,961 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:28,961 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:28,961 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:28,961 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:28,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:28,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:28,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:28,962 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:28,962 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:28,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:28,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:28,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:28,963 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:28,963 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:28,963 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:28,964 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:28,964 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:28,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:29,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:29,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:29,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:29,033 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:29,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:29,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-23 09:58:29,108 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5326daa/15297a02d3b349e0a0507b670ef1211d/FLAG05a0280ee [2018-11-23 09:58:29,549 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:29,550 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init2_false-unreach-call_ground.i [2018-11-23 09:58:29,556 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5326daa/15297a02d3b349e0a0507b670ef1211d/FLAG05a0280ee [2018-11-23 09:58:29,944 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5326daa/15297a02d3b349e0a0507b670ef1211d [2018-11-23 09:58:29,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:29,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:29,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:29,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:29,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:29,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65764f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:29, skipping insertion in model container [2018-11-23 09:58:29,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:29" (1/1) ... [2018-11-23 09:58:29,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:30,003 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:30,273 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:30,282 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:30,313 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:30,346 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:30,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30 WrapperNode [2018-11-23 09:58:30,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:30,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:30,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:30,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:30,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:30,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:30,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:30,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:30,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... [2018-11-23 09:58:30,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:30,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:30,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:30,445 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:30,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:30,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:30,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:58:31,136 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:31,136 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 09:58:31,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:31 BoogieIcfgContainer [2018-11-23 09:58:31,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:31,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:31,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:31,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:31,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:29" (1/3) ... [2018-11-23 09:58:31,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453eafdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:31, skipping insertion in model container [2018-11-23 09:58:31,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:30" (2/3) ... [2018-11-23 09:58:31,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@453eafdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:31, skipping insertion in model container [2018-11-23 09:58:31,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:31" (3/3) ... [2018-11-23 09:58:31,147 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init2_false-unreach-call_ground.i [2018-11-23 09:58:31,158 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:31,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:31,187 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:31,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:31,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:31,225 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:31,225 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:31,225 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:31,225 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:31,226 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:31,226 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:31,226 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 09:58:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:58:31,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:31,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:31,257 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:31,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2104113866, now seen corresponding path program 1 times [2018-11-23 09:58:31,270 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:31,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:31,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:31,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 09:58:31,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 09:58:31,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 09:58:31,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #61#return; {28#true} is VALID [2018-11-23 09:58:31,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2018-11-23 09:58:31,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {28#true} is VALID [2018-11-23 09:58:31,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 09:58:31,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0bv32; {29#false} is VALID [2018-11-23 09:58:31,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !~bvslt32(~i~0, 100000bv32); {29#false} is VALID [2018-11-23 09:58:31,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} havoc ~x~0;~x~0 := 0bv32; {29#false} is VALID [2018-11-23 09:58:31,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {29#false} is VALID [2018-11-23 09:58:31,573 INFO L256 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 09:58:31,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 09:58:31,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 09:58:31,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 09:58:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:31,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:31,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:31,590 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 09:58:31,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:31,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:31,748 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 09:58:31,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:31,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:31,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:31,763 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 09:58:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,021 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-11-23 09:58:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:32,021 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 09:58:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 09:58:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 09:58:32,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 09:58:32,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:32,247 INFO L225 Difference]: With dead ends: 43 [2018-11-23 09:58:32,247 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 09:58:32,251 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 09:58:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 09:58:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 09:58:32,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:32,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:32,323 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:32,324 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,328 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 09:58:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 09:58:32,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:32,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:32,329 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:32,329 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,333 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 09:58:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 09:58:32,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:32,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:32,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:32,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 09:58:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 09:58:32,342 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 09:58:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:32,343 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 09:58:32,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 09:58:32,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 09:58:32,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:32,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:32,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:32,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:32,345 INFO L82 PathProgramCache]: Analyzing trace with hash 743997126, now seen corresponding path program 1 times [2018-11-23 09:58:32,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:32,346 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:32,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:32,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:32,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2018-11-23 09:58:32,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {199#true} is VALID [2018-11-23 09:58:32,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {199#true} assume true; {199#true} is VALID [2018-11-23 09:58:32,492 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {199#true} {199#true} #61#return; {199#true} is VALID [2018-11-23 09:58:32,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {199#true} call #t~ret2 := main(); {199#true} is VALID [2018-11-23 09:58:32,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {199#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {219#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:32,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {219#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {200#false} is VALID [2018-11-23 09:58:32,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {200#false} ~i~0 := 0bv32; {200#false} is VALID [2018-11-23 09:58:32,515 INFO L273 TraceCheckUtils]: 8: Hoare triple {200#false} assume !~bvslt32(~i~0, 100000bv32); {200#false} is VALID [2018-11-23 09:58:32,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {200#false} havoc ~x~0;~x~0 := 0bv32; {200#false} is VALID [2018-11-23 09:58:32,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {200#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {200#false} is VALID [2018-11-23 09:58:32,516 INFO L256 TraceCheckUtils]: 11: Hoare triple {200#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {200#false} is VALID [2018-11-23 09:58:32,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#false} ~cond := #in~cond; {200#false} is VALID [2018-11-23 09:58:32,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {200#false} assume 0bv32 == ~cond; {200#false} is VALID [2018-11-23 09:58:32,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {200#false} assume !false; {200#false} is VALID [2018-11-23 09:58:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:32,519 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:32,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:32,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:32,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 09:58:32,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:32,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:32,565 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 09:58:32,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:32,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:32,566 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 09:58:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,744 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 09:58:32,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:32,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 09:58:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 09:58:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 09:58:32,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2018-11-23 09:58:33,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:33,126 INFO L225 Difference]: With dead ends: 35 [2018-11-23 09:58:33,126 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 09:58:33,127 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 09:58:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 09:58:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 09:58:33,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:33,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,145 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,145 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:33,148 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 09:58:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 09:58:33,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:33,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:33,149 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,149 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 09:58:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:33,151 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 09:58:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 09:58:33,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:33,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:33,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:33,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 09:58:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 09:58:33,155 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2018-11-23 09:58:33,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:33,155 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 09:58:33,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 09:58:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:58:33,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:33,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:33,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:33,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:33,157 INFO L82 PathProgramCache]: Analyzing trace with hash 494025381, now seen corresponding path program 1 times [2018-11-23 09:58:33,158 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:33,158 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:33,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:33,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:33,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 09:58:33,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {373#true} is VALID [2018-11-23 09:58:33,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 09:58:33,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #61#return; {373#true} is VALID [2018-11-23 09:58:33,380 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-23 09:58:33,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {393#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:33,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {393#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {397#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:33,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {374#false} is VALID [2018-11-23 09:58:33,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#false} ~i~0 := 0bv32; {374#false} is VALID [2018-11-23 09:58:33,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {374#false} is VALID [2018-11-23 09:58:33,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} assume !~bvslt32(~i~0, 100000bv32); {374#false} is VALID [2018-11-23 09:58:33,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {374#false} havoc ~x~0;~x~0 := 0bv32; {374#false} is VALID [2018-11-23 09:58:33,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {374#false} is VALID [2018-11-23 09:58:33,388 INFO L256 TraceCheckUtils]: 13: Hoare triple {374#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {374#false} is VALID [2018-11-23 09:58:33,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 09:58:33,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume 0bv32 == ~cond; {374#false} is VALID [2018-11-23 09:58:33,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 09:58:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:58:33,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:33,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 09:58:33,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume 0bv32 == ~cond; {374#false} is VALID [2018-11-23 09:58:33,457 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 09:58:33,457 INFO L256 TraceCheckUtils]: 13: Hoare triple {374#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {374#false} is VALID [2018-11-23 09:58:33,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {374#false} is VALID [2018-11-23 09:58:33,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {374#false} havoc ~x~0;~x~0 := 0bv32; {374#false} is VALID [2018-11-23 09:58:33,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} assume !~bvslt32(~i~0, 100000bv32); {374#false} is VALID [2018-11-23 09:58:33,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {374#false} is VALID [2018-11-23 09:58:33,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#false} ~i~0 := 0bv32; {374#false} is VALID [2018-11-23 09:58:33,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {455#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {374#false} is VALID [2018-11-23 09:58:33,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {459#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {455#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:33,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {459#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:33,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-23 09:58:33,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #61#return; {373#true} is VALID [2018-11-23 09:58:33,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 09:58:33,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {373#true} is VALID [2018-11-23 09:58:33,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 09:58:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 09:58:33,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:33,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:33,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 09:58:33,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:33,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:33,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:33,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:33,591 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-23 09:58:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:33,977 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 09:58:33,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:33,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 09:58:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 09:58:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2018-11-23 09:58:33,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2018-11-23 09:58:34,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:34,118 INFO L225 Difference]: With dead ends: 42 [2018-11-23 09:58:34,118 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 09:58:34,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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 09:58:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 09:58:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 09:58:34,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:34,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:34,138 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:34,138 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:34,140 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 09:58:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 09:58:34,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:34,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:34,141 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:34,142 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 09:58:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:34,144 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 09:58:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 09:58:34,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:34,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:34,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:34,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 09:58:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 09:58:34,148 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2018-11-23 09:58:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:34,148 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 09:58:34,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 09:58:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 09:58:34,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:34,150 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:34,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:34,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1902727046, now seen corresponding path program 2 times [2018-11-23 09:58:34,151 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:34,151 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:34,172 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:34,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:34,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:34,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:34,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {647#true} is VALID [2018-11-23 09:58:34,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {647#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {647#true} is VALID [2018-11-23 09:58:34,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2018-11-23 09:58:34,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #61#return; {647#true} is VALID [2018-11-23 09:58:34,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret2 := main(); {647#true} is VALID [2018-11-23 09:58:34,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {647#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {667#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:34,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {667#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:34,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {675#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:34,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {675#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {679#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:34,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {683#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:34,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {683#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {648#false} is VALID [2018-11-23 09:58:34,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#false} ~i~0 := 0bv32; {648#false} is VALID [2018-11-23 09:58:34,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,366 INFO L273 TraceCheckUtils]: 14: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {648#false} assume !~bvslt32(~i~0, 100000bv32); {648#false} is VALID [2018-11-23 09:58:34,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {648#false} havoc ~x~0;~x~0 := 0bv32; {648#false} is VALID [2018-11-23 09:58:34,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {648#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {648#false} is VALID [2018-11-23 09:58:34,368 INFO L256 TraceCheckUtils]: 19: Hoare triple {648#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {648#false} is VALID [2018-11-23 09:58:34,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {648#false} ~cond := #in~cond; {648#false} is VALID [2018-11-23 09:58:34,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {648#false} assume 0bv32 == ~cond; {648#false} is VALID [2018-11-23 09:58:34,369 INFO L273 TraceCheckUtils]: 22: Hoare triple {648#false} assume !false; {648#false} is VALID [2018-11-23 09:58:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 09:58:34,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:34,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {648#false} assume !false; {648#false} is VALID [2018-11-23 09:58:34,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {648#false} assume 0bv32 == ~cond; {648#false} is VALID [2018-11-23 09:58:34,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {648#false} ~cond := #in~cond; {648#false} is VALID [2018-11-23 09:58:34,539 INFO L256 TraceCheckUtils]: 19: Hoare triple {648#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {648#false} is VALID [2018-11-23 09:58:34,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {648#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {648#false} is VALID [2018-11-23 09:58:34,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {648#false} havoc ~x~0;~x~0 := 0bv32; {648#false} is VALID [2018-11-23 09:58:34,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {648#false} assume !~bvslt32(~i~0, 100000bv32); {648#false} is VALID [2018-11-23 09:58:34,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {648#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {648#false} is VALID [2018-11-23 09:58:34,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#false} ~i~0 := 0bv32; {648#false} is VALID [2018-11-23 09:58:34,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {759#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {648#false} is VALID [2018-11-23 09:58:34,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {763#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {759#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:34,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {767#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {763#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {771#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {767#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {775#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {771#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {647#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {775#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:34,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret2 := main(); {647#true} is VALID [2018-11-23 09:58:34,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #61#return; {647#true} is VALID [2018-11-23 09:58:34,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2018-11-23 09:58:34,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {647#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {647#true} is VALID [2018-11-23 09:58:34,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {647#true} is VALID [2018-11-23 09:58:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 09:58:34,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:34,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:34,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-23 09:58:34,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:34,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:34,619 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 09:58:34,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:34,620 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-11-23 09:58:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,825 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-23 09:58:35,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:35,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-23 09:58:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2018-11-23 09:58:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2018-11-23 09:58:35,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 68 transitions. [2018-11-23 09:58:35,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:35,990 INFO L225 Difference]: With dead ends: 57 [2018-11-23 09:58:35,990 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 09:58:35,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:58:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 09:58:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 09:58:36,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:36,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:36,018 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:36,019 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:36,022 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 09:58:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 09:58:36,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:36,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:36,023 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:36,024 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 09:58:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:36,026 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 09:58:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 09:58:36,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:36,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:36,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:36,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 09:58:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 09:58:36,030 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 23 [2018-11-23 09:58:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:36,030 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 09:58:36,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 09:58:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:58:36,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:36,032 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:36,032 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:36,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2119541926, now seen corresponding path program 3 times [2018-11-23 09:58:36,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:36,034 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:36,053 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:36,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:58:36,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:36,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:36,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2018-11-23 09:58:36,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {1047#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1047#true} is VALID [2018-11-23 09:58:36,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2018-11-23 09:58:36,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2018-11-23 09:58:36,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret2 := main(); {1047#true} is VALID [2018-11-23 09:58:36,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {1047#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1047#true} is VALID [2018-11-23 09:58:36,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,808 INFO L273 TraceCheckUtils]: 8: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:36,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {1047#true} assume !~bvslt32(~i~0, 100000bv32); {1047#true} is VALID [2018-11-23 09:58:36,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#true} ~i~0 := 0bv32; {1103#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:36,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {1103#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1107#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {1107#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1111#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:36,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {1111#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1115#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1119#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:36,831 INFO L273 TraceCheckUtils]: 22: Hoare triple {1119#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1123#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {1123#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1127#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {1127#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1131#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {1131#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1135#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {1135#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1139#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 09:58:36,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {1139#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1143#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {1143#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1048#false} is VALID [2018-11-23 09:58:36,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {1048#false} havoc ~x~0;~x~0 := 0bv32; {1048#false} is VALID [2018-11-23 09:58:36,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {1048#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1048#false} is VALID [2018-11-23 09:58:36,841 INFO L256 TraceCheckUtils]: 31: Hoare triple {1048#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {1048#false} is VALID [2018-11-23 09:58:36,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {1048#false} ~cond := #in~cond; {1048#false} is VALID [2018-11-23 09:58:36,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {1048#false} assume 0bv32 == ~cond; {1048#false} is VALID [2018-11-23 09:58:36,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2018-11-23 09:58:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 09:58:36,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:37,357 INFO L273 TraceCheckUtils]: 34: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2018-11-23 09:58:37,358 INFO L273 TraceCheckUtils]: 33: Hoare triple {1048#false} assume 0bv32 == ~cond; {1048#false} is VALID [2018-11-23 09:58:37,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {1048#false} ~cond := #in~cond; {1048#false} is VALID [2018-11-23 09:58:37,359 INFO L256 TraceCheckUtils]: 31: Hoare triple {1048#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {1048#false} is VALID [2018-11-23 09:58:37,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {1048#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1048#false} is VALID [2018-11-23 09:58:37,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {1048#false} havoc ~x~0;~x~0 := 0bv32; {1048#false} is VALID [2018-11-23 09:58:37,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {1183#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1048#false} is VALID [2018-11-23 09:58:37,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1183#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:37,368 INFO L273 TraceCheckUtils]: 26: Hoare triple {1191#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {1195#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1191#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {1199#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1195#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {1203#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1199#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,389 INFO L273 TraceCheckUtils]: 22: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1203#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {1211#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1207#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {1215#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1211#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {1219#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1215#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {1223#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1219#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,413 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#true} ~i~0 := 0bv32; {1223#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {1047#true} assume !~bvslt32(~i~0, 100000bv32); {1047#true} is VALID [2018-11-23 09:58:37,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {1047#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1047#true} is VALID [2018-11-23 09:58:37,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1047#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1047#true} is VALID [2018-11-23 09:58:37,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret2 := main(); {1047#true} is VALID [2018-11-23 09:58:37,417 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2018-11-23 09:58:37,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2018-11-23 09:58:37,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {1047#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1047#true} is VALID [2018-11-23 09:58:37,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2018-11-23 09:58:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 09:58:37,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:37,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:37,430 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-23 09:58:37,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:37,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:37,516 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 09:58:37,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:37,518 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 24 states. [2018-11-23 09:58:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,167 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2018-11-23 09:58:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:58:42,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-11-23 09:58:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2018-11-23 09:58:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 104 transitions. [2018-11-23 09:58:42,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 104 transitions. [2018-11-23 09:58:42,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:42,461 INFO L225 Difference]: With dead ends: 87 [2018-11-23 09:58:42,461 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 09:58:42,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:58:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 09:58:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 09:58:42,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:42,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:42,529 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:42,529 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,533 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 09:58:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 09:58:42,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:42,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:42,534 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:42,534 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 09:58:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,537 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 09:58:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 09:58:42,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:42,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:42,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:42,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 09:58:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 09:58:42,542 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 35 [2018-11-23 09:58:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:42,542 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 09:58:42,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:58:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 09:58:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 09:58:42,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:42,545 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:42,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:42,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:42,546 INFO L82 PathProgramCache]: Analyzing trace with hash 173663974, now seen corresponding path program 4 times [2018-11-23 09:58:42,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:42,546 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:42,575 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:42,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:42,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:42,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:43,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-23 09:58:43,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1709#true} is VALID [2018-11-23 09:58:43,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-23 09:58:43,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #61#return; {1709#true} is VALID [2018-11-23 09:58:43,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret2 := main(); {1709#true} is VALID [2018-11-23 09:58:43,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1729#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:43,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {1729#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1733#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,449 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1737#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {1737#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1745#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:43,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {1745#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1749#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {1749#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1753#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 09:58:43,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {1753#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1757#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {1757#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1761#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {1761#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1765#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {1765#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1769#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {1769#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1773#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 09:58:43,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {1773#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1777#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {1777#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1781#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {1781#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1785#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 09:58:43,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {1785#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1789#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {1789#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1793#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {1793#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1797#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:58:43,469 INFO L273 TraceCheckUtils]: 23: Hoare triple {1797#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1801#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {1801#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1805#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {1805#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1809#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {1809#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1813#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-23 09:58:43,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {1813#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1817#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,495 INFO L273 TraceCheckUtils]: 28: Hoare triple {1817#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1710#false} is VALID [2018-11-23 09:58:43,495 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#false} ~i~0 := 0bv32; {1710#false} is VALID [2018-11-23 09:58:43,496 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,496 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,496 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,497 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,497 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,498 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,499 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,499 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,499 INFO L273 TraceCheckUtils]: 47: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,500 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,500 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,500 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,500 INFO L273 TraceCheckUtils]: 51: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:43,500 INFO L273 TraceCheckUtils]: 52: Hoare triple {1710#false} assume !~bvslt32(~i~0, 100000bv32); {1710#false} is VALID [2018-11-23 09:58:43,501 INFO L273 TraceCheckUtils]: 53: Hoare triple {1710#false} havoc ~x~0;~x~0 := 0bv32; {1710#false} is VALID [2018-11-23 09:58:43,501 INFO L273 TraceCheckUtils]: 54: Hoare triple {1710#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1710#false} is VALID [2018-11-23 09:58:43,501 INFO L256 TraceCheckUtils]: 55: Hoare triple {1710#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {1710#false} is VALID [2018-11-23 09:58:43,501 INFO L273 TraceCheckUtils]: 56: Hoare triple {1710#false} ~cond := #in~cond; {1710#false} is VALID [2018-11-23 09:58:43,502 INFO L273 TraceCheckUtils]: 57: Hoare triple {1710#false} assume 0bv32 == ~cond; {1710#false} is VALID [2018-11-23 09:58:43,502 INFO L273 TraceCheckUtils]: 58: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-23 09:58:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 09:58:43,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:45,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-23 09:58:45,540 INFO L273 TraceCheckUtils]: 57: Hoare triple {1710#false} assume 0bv32 == ~cond; {1710#false} is VALID [2018-11-23 09:58:45,540 INFO L273 TraceCheckUtils]: 56: Hoare triple {1710#false} ~cond := #in~cond; {1710#false} is VALID [2018-11-23 09:58:45,540 INFO L256 TraceCheckUtils]: 55: Hoare triple {1710#false} call __VERIFIER_assert((if 42bv32 == #t~mem1 then 1bv32 else 0bv32)); {1710#false} is VALID [2018-11-23 09:58:45,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {1710#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1710#false} is VALID [2018-11-23 09:58:45,541 INFO L273 TraceCheckUtils]: 53: Hoare triple {1710#false} havoc ~x~0;~x~0 := 0bv32; {1710#false} is VALID [2018-11-23 09:58:45,541 INFO L273 TraceCheckUtils]: 52: Hoare triple {1710#false} assume !~bvslt32(~i~0, 100000bv32); {1710#false} is VALID [2018-11-23 09:58:45,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,541 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,541 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,541 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,542 INFO L273 TraceCheckUtils]: 47: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,542 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,543 INFO L273 TraceCheckUtils]: 41: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,543 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,545 INFO L273 TraceCheckUtils]: 30: Hoare triple {1710#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1710#false} is VALID [2018-11-23 09:58:45,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {1710#false} ~i~0 := 0bv32; {1710#false} is VALID [2018-11-23 09:58:45,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {2001#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1710#false} is VALID [2018-11-23 09:58:45,546 INFO L273 TraceCheckUtils]: 27: Hoare triple {2005#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2001#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:45,551 INFO L273 TraceCheckUtils]: 26: Hoare triple {2009#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2005#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {2013#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2009#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,562 INFO L273 TraceCheckUtils]: 24: Hoare triple {2017#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2013#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2017#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {2025#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2021#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2025#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2029#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {2037#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {2041#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2037#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {2045#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2041#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {2049#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2045#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {2053#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2049#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {2057#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2053#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {2061#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2057#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {2065#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2061#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {2069#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2065#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {2073#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2069#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {2077#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2073#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {2081#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2077#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {2085#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2081#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {2089#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2085#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2089#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret2 := main(); {1709#true} is VALID [2018-11-23 09:58:45,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #61#return; {1709#true} is VALID [2018-11-23 09:58:45,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-23 09:58:45,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1709#true} is VALID [2018-11-23 09:58:45,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-23 09:58:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 09:58:45,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:58:45,666 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 59 [2018-11-23 09:58:45,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:45,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:58:45,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:45,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:58:45,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:58:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:58:45,799 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 48 states. [2018-11-23 09:58:49,667 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:58:50,151 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:58:50,674 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:58:51,232 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:58:51,780 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:58:52,332 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:58:52,952 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:58:53,528 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 09:59:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:06,285 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2018-11-23 09:59:06,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:59:06,286 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 59 [2018-11-23 09:59:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 176 transitions. [2018-11-23 09:59:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 176 transitions. [2018-11-23 09:59:06,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 176 transitions. [2018-11-23 09:59:06,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:06,762 INFO L225 Difference]: With dead ends: 147 [2018-11-23 09:59:06,762 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 09:59:06,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:59:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 09:59:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-23 09:59:06,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:06,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-23 09:59:06,876 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 09:59:06,876 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 09:59:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:06,881 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-11-23 09:59:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-11-23 09:59:06,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:06,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:06,883 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-23 09:59:06,883 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-23 09:59:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:06,887 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-11-23 09:59:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-11-23 09:59:06,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:06,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:06,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:06,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 09:59:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-11-23 09:59:06,892 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 59 [2018-11-23 09:59:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:06,892 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-11-23 09:59:06,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:59:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-11-23 09:59:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-23 09:59:06,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:06,896 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:06,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:06,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash -987182234, now seen corresponding path program 5 times [2018-11-23 09:59:06,898 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:06,898 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:59:06,925 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1