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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:54:58,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:54:58,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:54:58,042 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:54:58,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:54:58,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:54:58,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:54:58,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:54:58,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:54:58,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:54:58,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:54:58,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:54:58,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:54:58,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:54:58,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:54:58,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:54:58,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:54:58,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:54:58,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:54:58,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:54:58,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:54:58,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:54:58,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:54:58,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:54:58,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:54:58,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:54:58,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:54:58,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:54:58,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:54:58,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:54:58,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:54:58,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:54:58,081 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:54:58,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:54:58,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:54:58,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:54:58,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:54:58,114 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:54:58,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:54:58,115 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:54:58,115 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:54:58,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:54:58,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:54:58,117 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:54:58,117 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:54:58,117 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:54:58,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:54:58,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:54:58,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:54:58,118 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:54:58,118 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:54:58,118 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:54:58,119 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:54:58,119 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:54:58,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:54:58,119 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:54:58,120 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:54:58,120 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:54:58,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:54:58,120 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:54:58,120 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:54:58,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:54:58,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:54:58,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:54:58,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:54:58,123 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:54:58,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:54:58,123 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:54:58,123 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:54:58,123 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:54:58,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:54:58,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:54:58,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:54:58,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:54:58,194 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:54:58,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i [2018-11-14 17:54:58,250 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e151b940a/537fead921a248e1a25f21b26067faae/FLAGaa20db11c [2018-11-14 17:54:58,661 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:54:58,662 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i [2018-11-14 17:54:58,670 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e151b940a/537fead921a248e1a25f21b26067faae/FLAGaa20db11c [2018-11-14 17:54:58,684 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e151b940a/537fead921a248e1a25f21b26067faae [2018-11-14 17:54:58,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:54:58,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:54:58,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:54:58,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:54:58,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:54:58,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:54:58" (1/1) ... [2018-11-14 17:54:58,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6a182c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:58, skipping insertion in model container [2018-11-14 17:54:58,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:54:58" (1/1) ... [2018-11-14 17:54:58,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:54:58,745 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:54:59,005 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:54:59,011 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:54:59,042 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:54:59,066 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:54:59,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59 WrapperNode [2018-11-14 17:54:59,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:54:59,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:54:59,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:54:59,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:54:59,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (1/1) ... [2018-11-14 17:54:59,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:54:59,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:54:59,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:54:59,122 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:54:59,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (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-14 17:54:59,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:54:59,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:54:59,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:54:59,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:54:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-14 17:54:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:54:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:54:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:54:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:54:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:54:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:54:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:54:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:54:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:54:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:54:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:54:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:54:59,926 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:54:59,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:54:59 BoogieIcfgContainer [2018-11-14 17:54:59,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:54:59,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:54:59,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:54:59,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:54:59,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:54:58" (1/3) ... [2018-11-14 17:54:59,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2977bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:54:59, skipping insertion in model container [2018-11-14 17:54:59,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:54:59" (2/3) ... [2018-11-14 17:54:59,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2977bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:54:59, skipping insertion in model container [2018-11-14 17:54:59,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:54:59" (3/3) ... [2018-11-14 17:54:59,935 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr3_true-unreach-call.i [2018-11-14 17:54:59,943 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:54:59,950 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:54:59,965 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:54:59,999 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:54:59,999 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:55:00,000 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:55:00,000 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:55:00,000 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:55:00,000 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:55:00,000 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:55:00,001 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:55:00,001 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:55:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:55:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:55:00,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:00,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:55:00,030 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:00,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1024731985, now seen corresponding path program 1 times [2018-11-14 17:55:00,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:00,043 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-14 17:55:00,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:00,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:00,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:55:00,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {37#true} is VALID [2018-11-14 17:55:00,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:55:00,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2018-11-14 17:55:00,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2018-11-14 17:55:00,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-14 17:55:00,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {37#true} is VALID [2018-11-14 17:55:00,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {37#true} is VALID [2018-11-14 17:55:00,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:55:00,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-14 17:55:00,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:55:00,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {38#false} is VALID [2018-11-14 17:55:00,335 INFO L256 TraceCheckUtils]: 12: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {38#false} is VALID [2018-11-14 17:55:00,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 17:55:00,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume ~cond == 0bv32; {38#false} is VALID [2018-11-14 17:55:00,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:55:00,340 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-14 17:55:00,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:55:00,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:55:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:55:00,351 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:55:00,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:00,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:55:00,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:00,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:55:00,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:55:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:55:00,488 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:55:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:00,799 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-14 17:55:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:55:00,799 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:55:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:55:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-14 17:55:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:55:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-14 17:55:00,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2018-11-14 17:55:01,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:01,149 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:55:01,149 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:55:01,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:55:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:55:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:55:01,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:01,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:55:01,197 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:55:01,197 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:55:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:01,202 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 17:55:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:55:01,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:01,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:01,203 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:55:01,203 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:55:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:01,208 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 17:55:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:55:01,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:01,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:01,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:01,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:55:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 17:55:01,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2018-11-14 17:55:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:01,215 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 17:55:01,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:55:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:55:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:55:01,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:01,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:55:01,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:01,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1869615823, now seen corresponding path program 1 times [2018-11-14 17:55:01,218 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:01,218 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-14 17:55:01,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:01,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:01,683 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 17:55:01,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2018-11-14 17:55:01,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {241#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {241#true} is VALID [2018-11-14 17:55:01,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2018-11-14 17:55:01,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #83#return; {241#true} is VALID [2018-11-14 17:55:01,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret8 := main(); {241#true} is VALID [2018-11-14 17:55:01,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {241#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {241#true} is VALID [2018-11-14 17:55:01,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {241#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {264#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-14 17:55:01,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {264#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {268#(and (= (bvsrem ~SIZE~0 (_ bv3 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:01,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {268#(and (= (bvsrem ~SIZE~0 (_ bv3 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {268#(and (= (bvsrem ~SIZE~0 (_ bv3 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:02,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {268#(and (= (bvsrem ~SIZE~0 (_ bv3 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {242#false} is VALID [2018-11-14 17:55:02,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {242#false} ~i~0 := 0bv32; {242#false} is VALID [2018-11-14 17:55:02,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#false} assume true; {242#false} is VALID [2018-11-14 17:55:02,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {242#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {242#false} is VALID [2018-11-14 17:55:02,005 INFO L256 TraceCheckUtils]: 13: Hoare triple {242#false} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {242#false} is VALID [2018-11-14 17:55:02,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2018-11-14 17:55:02,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {242#false} assume ~cond == 0bv32; {242#false} is VALID [2018-11-14 17:55:02,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {242#false} assume !false; {242#false} is VALID [2018-11-14 17:55:02,008 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-14 17:55:02,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:55:02,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:55:02,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:55:02,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 17:55:02,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:02,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:55:02,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:02,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:55:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:55:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:55:02,152 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2018-11-14 17:55:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:03,775 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 17:55:03,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:55:03,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 17:55:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:55:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 17:55:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:55:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 17:55:03,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-14 17:55:04,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:04,122 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:55:04,122 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:55:04,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:55:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:55:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-14 17:55:04,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:04,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-14 17:55:04,151 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-14 17:55:04,151 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-14 17:55:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:04,154 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-14 17:55:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 17:55:04,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:04,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:04,156 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-14 17:55:04,156 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-14 17:55:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:04,159 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-14 17:55:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 17:55:04,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:04,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:04,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:04,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:55:04,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 17:55:04,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-14 17:55:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:04,164 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 17:55:04,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:55:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 17:55:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:55:04,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:04,165 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:55:04,166 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:04,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1249925920, now seen corresponding path program 1 times [2018-11-14 17:55:04,167 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:04,167 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-14 17:55:04,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:04,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:04,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 17:55:04,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 17:55:04,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:04,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-14 17:55:04,895 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:05,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-14 17:55:05,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:05,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-14 17:55:05,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-14 17:55:05,138 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:05,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-11-14 17:55:05,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:05,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-11-14 17:55:05,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-14 17:55:05,345 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:05,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-14 17:55:05,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 17:55:05,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:05,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-14 17:55:05,555 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:05,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 17:55:05,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {466#true} is VALID [2018-11-14 17:55:05,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 17:55:05,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #83#return; {466#true} is VALID [2018-11-14 17:55:05,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret8 := main(); {466#true} is VALID [2018-11-14 17:55:05,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {466#true} is VALID [2018-11-14 17:55:05,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {466#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {489#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {493#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {493#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {493#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {493#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {493#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:05,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {503#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {516#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {529#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {529#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {529#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {529#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {536#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:05,810 INFO L256 TraceCheckUtils]: 21: Hoare triple {536#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {540#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:05,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {540#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {544#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:05,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {544#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {467#false} is VALID [2018-11-14 17:55:05,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 17:55:05,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:05,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:07,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-14 17:55:07,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-14 17:55:07,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:07,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-14 17:55:07,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:07,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-14 17:55:07,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:07,171 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:07,176 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:07,176 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:07,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 43 [2018-11-14 17:55:07,199 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 17:55:07,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:55:07,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:55:07,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:55:07,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:55:07,387 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:36, output treesize:43 [2018-11-14 17:55:07,395 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:07,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 17:55:07,480 INFO L273 TraceCheckUtils]: 23: Hoare triple {554#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {467#false} is VALID [2018-11-14 17:55:07,481 INFO L273 TraceCheckUtils]: 22: Hoare triple {558#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {554#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:07,482 INFO L256 TraceCheckUtils]: 21: Hoare triple {562#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {558#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:07,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {566#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {562#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-14 17:55:07,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {566#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {566#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:07,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {566#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:07,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:07,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume true; {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:07,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:07,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {573#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:07,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {586#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:55:07,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {593#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_1) |main_~#a~0.offset|))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {586#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:55:07,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {593#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_1) |main_~#a~0.offset|))))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {593#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_1) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:55:07,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {600#(= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {593#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_1 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_1) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:55:07,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {600#(= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {600#(= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:07,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {600#(= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32))} assume true; {600#(= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:07,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {466#true} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {600#(= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:07,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {466#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {466#true} is VALID [2018-11-14 17:55:07,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {466#true} is VALID [2018-11-14 17:55:07,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret8 := main(); {466#true} is VALID [2018-11-14 17:55:07,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #83#return; {466#true} is VALID [2018-11-14 17:55:07,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 17:55:07,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {466#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {466#true} is VALID [2018-11-14 17:55:07,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 17:55:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:07,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:07,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 17:55:07,539 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 17:55:07,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:07,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:55:07,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:07,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:55:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:55:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:55:07,720 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2018-11-14 17:55:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:12,686 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2018-11-14 17:55:12,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:55:12,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 17:55:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:55:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-14 17:55:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:55:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-14 17:55:12,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2018-11-14 17:55:13,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:13,105 INFO L225 Difference]: With dead ends: 91 [2018-11-14 17:55:13,105 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 17:55:13,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:55:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 17:55:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2018-11-14 17:55:13,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:13,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 59 states. [2018-11-14 17:55:13,191 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 59 states. [2018-11-14 17:55:13,191 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 59 states. [2018-11-14 17:55:13,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:13,203 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-14 17:55:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-14 17:55:13,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:13,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:13,205 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 89 states. [2018-11-14 17:55:13,205 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 89 states. [2018-11-14 17:55:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:13,219 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-14 17:55:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-14 17:55:13,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:13,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:13,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:13,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:55:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-11-14 17:55:13,225 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 25 [2018-11-14 17:55:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:13,225 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-14 17:55:13,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:55:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-14 17:55:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:55:13,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:13,227 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:55:13,227 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:13,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1765177698, now seen corresponding path program 1 times [2018-11-14 17:55:13,228 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:13,228 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-14 17:55:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:13,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:13,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 17:55:13,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 17:55:13,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 17:55:13,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-14 17:55:13,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:13,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-14 17:55:13,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2018-11-14 17:55:13,747 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:13,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 17:55:13,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:13,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 17:55:13,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:13,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-14 17:55:13,970 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:14,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:55:14,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:55:14,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:14,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:14,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:14,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-14 17:55:14,149 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:14,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-14 17:55:14,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1005#true} is VALID [2018-11-14 17:55:14,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-14 17:55:14,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #83#return; {1005#true} is VALID [2018-11-14 17:55:14,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret8 := main(); {1005#true} is VALID [2018-11-14 17:55:14,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1005#true} is VALID [2018-11-14 17:55:14,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {1005#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1028#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {1028#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1032#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1032#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1032#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1032#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1032#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {1032#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:14,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {1042#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1055#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {1068#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1068#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1068#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {1068#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv4294967286 32)) (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1075#(and (= (_ bv10 32) |main_#t~mem7|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:14,252 INFO L256 TraceCheckUtils]: 21: Hoare triple {1075#(and (= (_ bv10 32) |main_#t~mem7|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1079#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:14,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {1079#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1083#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:14,258 INFO L273 TraceCheckUtils]: 23: Hoare triple {1083#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1006#false} is VALID [2018-11-14 17:55:14,259 INFO L273 TraceCheckUtils]: 24: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-14 17:55:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:14,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:14,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-14 17:55:14,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-14 17:55:14,680 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:14,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-11-14 17:55:14,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:14,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-14 17:55:14,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:14,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:14,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 45 [2018-11-14 17:55:14,849 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-14 17:55:15,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 17:55:15,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 17:55:15,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 17:55:15,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 17:55:15,228 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:61 [2018-11-14 17:55:15,235 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:15,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-14 17:55:15,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1006#false} is VALID [2018-11-14 17:55:15,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {1097#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1093#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:15,345 INFO L256 TraceCheckUtils]: 21: Hoare triple {1101#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1097#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:15,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {1105#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1101#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-14 17:55:15,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {1105#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {1105#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:15,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} ~i~0 := 0bv32; {1105#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:15,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:15,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} assume true; {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:15,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:15,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {1125#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {1112#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))} is VALID [2018-11-14 17:55:15,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {1125#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1125#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:55:15,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {1132#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_3 (_ BitVec 32))) (not (= (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_3) |main_~#a~0.offset|) main_~DEFAULTVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {1125#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:55:15,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {1132#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_3 (_ BitVec 32))) (not (= (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_3) |main_~#a~0.offset|) main_~DEFAULTVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1132#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_3 (_ BitVec 32))) (not (= (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_3) |main_~#a~0.offset|) main_~DEFAULTVAL~0)))} is VALID [2018-11-14 17:55:15,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {1139#(and (= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {1132#(forall ((main_~value~0 (_ BitVec 32)) (v_subst_3 (_ BitVec 32))) (not (= (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)) main_~value~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) v_subst_3) |main_~#a~0.offset|) main_~DEFAULTVAL~0)))} is VALID [2018-11-14 17:55:15,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1139#(and (= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1139#(and (= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:15,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {1139#(and (= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume true; {1139#(and (= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:15,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {1149#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1139#(and (= (bvadd (bvmul (_ bv12 32) main_~i~0) (_ bv4294967284 32)) (_ bv0 32)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:55:15,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1005#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1149#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-14 17:55:15,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1005#true} is VALID [2018-11-14 17:55:15,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret8 := main(); {1005#true} is VALID [2018-11-14 17:55:15,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #83#return; {1005#true} is VALID [2018-11-14 17:55:15,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-14 17:55:15,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1005#true} is VALID [2018-11-14 17:55:15,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-14 17:55:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:15,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:15,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-14 17:55:15,403 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-14 17:55:15,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:15,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:55:15,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:15,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:55:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:55:15,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:55:15,570 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 19 states. [2018-11-14 17:55:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:22,621 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2018-11-14 17:55:22,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:55:22,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-14 17:55:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:55:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:55:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 124 transitions. [2018-11-14 17:55:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:55:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 124 transitions. [2018-11-14 17:55:22,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 124 transitions. [2018-11-14 17:55:25,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 123 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:25,129 INFO L225 Difference]: With dead ends: 120 [2018-11-14 17:55:25,129 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 17:55:25,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:55:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 17:55:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 37. [2018-11-14 17:55:25,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:55:25,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 37 states. [2018-11-14 17:55:25,251 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 37 states. [2018-11-14 17:55:25,251 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 37 states. [2018-11-14 17:55:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:25,257 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2018-11-14 17:55:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-11-14 17:55:25,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:25,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:25,259 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 118 states. [2018-11-14 17:55:25,259 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 118 states. [2018-11-14 17:55:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:55:25,265 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2018-11-14 17:55:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-11-14 17:55:25,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:55:25,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:55:25,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:55:25,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:55:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:55:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 17:55:25,270 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2018-11-14 17:55:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:55:25,271 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 17:55:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:55:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:55:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:55:25,275 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:55:25,275 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:55:25,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:55:25,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:55:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -5809233, now seen corresponding path program 1 times [2018-11-14 17:55:25,276 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:55:25,276 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-14 17:55:25,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:55:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:55:25,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:55:25,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 17:55:25,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 17:55:25,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:25,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:25,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:25,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-14 17:55:25,730 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:25,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-14 17:55:25,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:55:25,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-14 17:55:25,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:25,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:25,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:25,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-14 17:55:25,858 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:26,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-14 17:55:26,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 17:55:26,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:26,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:26,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:55:26,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-14 17:55:26,096 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:26,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-14 17:55:26,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {1631#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1631#true} is VALID [2018-11-14 17:55:26,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-14 17:55:26,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2018-11-14 17:55:26,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret8 := main(); {1631#true} is VALID [2018-11-14 17:55:26,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1631#true} is VALID [2018-11-14 17:55:26,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {1631#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1654#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {1654#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {1658#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {1681#(and (= |main_~#a~0.offset| (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,185 INFO L273 TraceCheckUtils]: 20: Hoare triple {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,186 INFO L256 TraceCheckUtils]: 21: Hoare triple {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:26,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} ~cond := #in~cond; {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:26,187 INFO L273 TraceCheckUtils]: 23: Hoare triple {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} assume !(~cond == 0bv32); {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:26,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} assume true; {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-14 17:55:26,188 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1704#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv0 32))))} {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #81#return; {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem7; {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,190 INFO L273 TraceCheckUtils]: 27: Hoare triple {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:55:26,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {1674#(and (not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1729#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:55:26,195 INFO L256 TraceCheckUtils]: 30: Hoare triple {1729#(and (not (= main_~DEFAULTVAL~0 |main_#t~mem7|)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1733#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:26,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {1733#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1737#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:55:26,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {1737#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1632#false} is VALID [2018-11-14 17:55:26,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-14 17:55:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:26,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:55:26,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-14 17:55:26,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-14 17:55:26,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:26,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:55:26,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-14 17:55:26,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:26,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-14 17:55:26,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:55:26,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:26,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:26,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:55:26,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:27 [2018-11-14 17:55:26,826 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:55:26,916 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-14 17:55:26,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {1747#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1632#false} is VALID [2018-11-14 17:55:26,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {1751#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1747#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:55:26,919 INFO L256 TraceCheckUtils]: 30: Hoare triple {1755#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1751#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:55:26,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {1759#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1755#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-14 17:55:26,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {1759#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {1759#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:27,126 INFO L273 TraceCheckUtils]: 27: Hoare triple {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1759#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:55:27,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem7; {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:27,129 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1631#true} {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #81#return; {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:27,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-14 17:55:27,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {1631#true} assume !(~cond == 0bv32); {1631#true} is VALID [2018-11-14 17:55:27,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2018-11-14 17:55:27,130 INFO L256 TraceCheckUtils]: 21: Hoare triple {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {1631#true} is VALID [2018-11-14 17:55:27,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:27,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume true; {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:27,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {1766#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:55:27,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:27,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume true; {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:27,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:27,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {1807#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {1794#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:55:27,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {1807#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {1807#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 17:55:27,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {1807#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 17:55:27,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} is VALID [2018-11-14 17:55:27,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} is VALID [2018-11-14 17:55:27,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} is VALID [2018-11-14 17:55:27,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} assume true; {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} is VALID [2018-11-14 17:55:27,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {1631#true} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {1814#(= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0))} is VALID [2018-11-14 17:55:27,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {1631#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {1631#true} is VALID [2018-11-14 17:55:27,163 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1631#true} is VALID [2018-11-14 17:55:27,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret8 := main(); {1631#true} is VALID [2018-11-14 17:55:27,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2018-11-14 17:55:27,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-14 17:55:27,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {1631#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1631#true} is VALID [2018-11-14 17:55:27,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-14 17:55:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:55:27,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:55:27,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-14 17:55:27,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-14 17:55:27,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:55:27,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:55:27,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:55:27,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:55:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:55:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:55:27,582 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-11-14 17:56:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:56:31,157 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2018-11-14 17:56:31,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:56:31,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-14 17:56:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:56:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:56:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2018-11-14 17:56:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:56:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2018-11-14 17:56:31,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 135 transitions. [2018-11-14 17:56:31,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:56:31,652 INFO L225 Difference]: With dead ends: 120 [2018-11-14 17:56:31,652 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 17:56:31,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2018-11-14 17:56:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 17:56:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 68. [2018-11-14 17:56:31,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:56:31,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 68 states. [2018-11-14 17:56:31,942 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 68 states. [2018-11-14 17:56:31,942 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 68 states. [2018-11-14 17:56:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:56:31,948 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2018-11-14 17:56:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2018-11-14 17:56:31,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:56:31,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:56:31,949 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 118 states. [2018-11-14 17:56:31,949 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 118 states. [2018-11-14 17:56:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:56:31,954 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2018-11-14 17:56:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2018-11-14 17:56:31,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:56:31,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:56:31,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:56:31,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:56:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:56:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-14 17:56:31,957 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 34 [2018-11-14 17:56:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:56:31,958 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-14 17:56:31,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:56:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-14 17:56:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:56:31,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:56:31,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:56:31,959 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:56:31,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:56:31,960 INFO L82 PathProgramCache]: Analyzing trace with hash 213045485, now seen corresponding path program 1 times [2018-11-14 17:56:31,960 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:56:31,960 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-14 17:56:31,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:56:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:56:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:56:32,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:56:32,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 17:56:32,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 17:56:32,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 17:56:32,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-14 17:56:32,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:56:32,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-14 17:56:32,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-14 17:56:32,417 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:32,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:56:32,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:56:32,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:56:32,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-14 17:56:32,609 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:32,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 17:56:32,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {2339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2339#true} is VALID [2018-11-14 17:56:32,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 17:56:32,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #83#return; {2339#true} is VALID [2018-11-14 17:56:32,913 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret8 := main(); {2339#true} is VALID [2018-11-14 17:56:32,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2339#true} is VALID [2018-11-14 17:56:32,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {2339#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2362#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {2362#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {2366#(and (= (bvadd main_~FIXEDVAL~0 (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {2389#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} ~i~0 := 0bv32; {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume true; {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,943 INFO L273 TraceCheckUtils]: 20: Hoare triple {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,945 INFO L256 TraceCheckUtils]: 21: Hoare triple {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} ~cond := #in~cond; {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume !(~cond == 0bv32); {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,948 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2412#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967286 32)) (_ bv0 32)))} {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #81#return; {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} havoc #t~mem7; {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {2402#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967286 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~DEFAULTVAL~0 (_ bv0 32)))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:56:32,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {2382#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv10 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967288 32)))) (= main_~DEFAULTVAL~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2437#(and (= (_ bv10 32) |main_#t~mem7|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} is VALID [2018-11-14 17:56:32,954 INFO L256 TraceCheckUtils]: 30: Hoare triple {2437#(and (= (_ bv10 32) |main_#t~mem7|) (= main_~DEFAULTVAL~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2441#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:32,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {2441#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2445#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:56:32,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {2445#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {2340#false} is VALID [2018-11-14 17:56:32,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 17:56:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:56:32,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:56:33,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-14 17:56:33,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-14 17:56:33,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-14 17:56:33,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:56:33,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-11-14 17:56:33,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 17:56:33,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:56:33,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:56:33,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 17:56:33,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:39 [2018-11-14 17:56:33,538 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:56:33,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 17:56:33,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {2455#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {2340#false} is VALID [2018-11-14 17:56:33,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {2459#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2455#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 17:56:33,799 INFO L256 TraceCheckUtils]: 30: Hoare triple {2463#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2459#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 17:56:33,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {2467#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2463#(not (= main_~DEFAULTVAL~0 |main_#t~mem7|))} is VALID [2018-11-14 17:56:33,800 INFO L273 TraceCheckUtils]: 28: Hoare triple {2467#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} assume true; {2467#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:56:33,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2467#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))} is VALID [2018-11-14 17:56:33,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} havoc #t~mem7; {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:33,991 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2339#true} {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} #81#return; {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:33,991 INFO L273 TraceCheckUtils]: 24: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 17:56:33,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {2339#true} assume !(~cond == 0bv32); {2339#true} is VALID [2018-11-14 17:56:33,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {2339#true} ~cond := #in~cond; {2339#true} is VALID [2018-11-14 17:56:33,992 INFO L256 TraceCheckUtils]: 21: Hoare triple {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} call __VERIFIER_assert((if #t~mem7 != ~DEFAULTVAL~0 then 1bv32 else 0bv32)); {2339#true} is VALID [2018-11-14 17:56:33,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:34,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} assume true; {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:34,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {2474#(not (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~DEFAULTVAL~0))} is VALID [2018-11-14 17:56:34,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32)); {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:56:34,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume true; {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:56:34,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:56:34,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {2515#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 1bv32))), 4bv32); {2502#(not (= main_~DEFAULTVAL~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-14 17:56:34,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {2515#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} call #t~ret5 := ReadFromPort();~value~0 := #t~ret5;havoc #t~ret5; {2515#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 17:56:34,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !(~value~0 != ~DEFAULTVAL~0);call write~intINTTYPE4(~FIXEDVAL~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 2bv32))), 4bv32); {2515#(forall ((main_~value~0 (_ BitVec 32))) (not (= main_~DEFAULTVAL~0 (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv12 32) main_~i~0) (_ bv4294967292 32)) main_~value~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-14 17:56:34,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} call #t~ret4 := ReadFromPort();~value~0 := #t~ret4;havoc #t~ret4; {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:56:34,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume ~value~0 != ~DEFAULTVAL~0;call write~intINTTYPE4(~value~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(3bv32, ~i~0), 3bv32))), 4bv32); {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:56:34,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 3bv32));call #t~ret3 := ReadFromPort();~value~0 := #t~ret3;havoc #t~ret3; {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:56:34,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} assume true; {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:56:34,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {2538#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} assume !(~bvsrem32(~SIZE~0, 3bv32) != 0bv32);assume (if ~bvsrem32(~SIZE~0, 3bv32) == 0bv32 then 1bv32 else 0bv32) != 0bv32;~i~0 := 1bv32; {2522#(and (= (_ bv12 32) (bvmul (_ bv12 32) main_~i~0)) (not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0)))} is VALID [2018-11-14 17:56:34,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {2339#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;havoc ~value~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~DEFAULTVAL~0 := 0bv32;~FIXEDVAL~0 := 10bv32; {2538#(not (= main_~DEFAULTVAL~0 main_~FIXEDVAL~0))} is VALID [2018-11-14 17:56:34,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2339#true} is VALID [2018-11-14 17:56:34,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret8 := main(); {2339#true} is VALID [2018-11-14 17:56:34,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #83#return; {2339#true} is VALID [2018-11-14 17:56:34,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 17:56:34,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {2339#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2339#true} is VALID [2018-11-14 17:56:34,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 17:56:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:56:34,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:56:34,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 17:56:34,059 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-11-14 17:56:34,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:56:34,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:56:34,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:56:34,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:56:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:56:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:56:34,449 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 20 states.