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.epf -i ../../../trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:05:21,136 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:05:21,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:05:21,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:05:21,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:05:21,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:05:21,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:05:21,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:05:21,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:05:21,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:05:21,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:05:21,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:05:21,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:05:21,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:05:21,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:05:21,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:05:21,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:05:21,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:05:21,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:05:21,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:05:21,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:05:21,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:05:21,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:05:21,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:05:21,198 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:05:21,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:05:21,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:05:21,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:05:21,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:05:21,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:05:21,205 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:05:21,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:05:21,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:05:21,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:05:21,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:05:21,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:05:21,210 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:05:21,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:05:21,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:05:21,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:05:21,244 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:05:21,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:05:21,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:05:21,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:05:21,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:05:21,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:05:21,246 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:05:21,246 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:05:21,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:05:21,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:05:21,247 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:05:21,247 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:05:21,247 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:05:21,248 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:05:21,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:05:21,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:05:21,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:05:21,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:05:21,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:05:21,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:05:21,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:05:21,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:05:21,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:05:21,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:05:21,250 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:05:21,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:05:21,250 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:05:21,250 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:05:21,250 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:05:21,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:05:21,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:05:21,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:05:21,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:05:21,335 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:05:21,335 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 16:05:21,407 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f32099ba/99c0925de6384764af4a774d87279297/FLAG0b994df37 [2018-11-14 16:05:21,937 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:05:21,938 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pnr3_true-unreach-call.i [2018-11-14 16:05:21,946 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f32099ba/99c0925de6384764af4a774d87279297/FLAG0b994df37 [2018-11-14 16:05:21,962 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f32099ba/99c0925de6384764af4a774d87279297 [2018-11-14 16:05:21,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:05:21,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:05:21,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:05:21,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:05:21,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:05:21,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:05:21" (1/1) ... [2018-11-14 16:05:21,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695698a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:21, skipping insertion in model container [2018-11-14 16:05:21,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:05:21" (1/1) ... [2018-11-14 16:05:21,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:05:22,027 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:05:22,282 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:05:22,291 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:05:22,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:05:22,346 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:05:22,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22 WrapperNode [2018-11-14 16:05:22,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:05:22,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:05:22,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:05:22,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:05:22,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... [2018-11-14 16:05:22,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:05:22,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:05:22,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:05:22,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:05:22,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:05:22,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:05:22,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:05:22,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:05:22,532 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:05:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure ReadFromPort [2018-11-14 16:05:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:05:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:05:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:05:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:05:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:05:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:05:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:05:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:05:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:05:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:05:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:05:22,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:05:23,308 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:05:23,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:05:23 BoogieIcfgContainer [2018-11-14 16:05:23,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:05:23,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:05:23,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:05:23,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:05:23,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:05:21" (1/3) ... [2018-11-14 16:05:23,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6f54e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:05:23, skipping insertion in model container [2018-11-14 16:05:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:22" (2/3) ... [2018-11-14 16:05:23,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6f54e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:05:23, skipping insertion in model container [2018-11-14 16:05:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:05:23" (3/3) ... [2018-11-14 16:05:23,318 INFO L112 eAbstractionObserver]: Analyzing ICFG pnr3_true-unreach-call.i [2018-11-14 16:05:23,328 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:05:23,336 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:05:23,353 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:05:23,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:05:23,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:05:23,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:05:23,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:05:23,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:05:23,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:05:23,390 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:05:23,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:05:23,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:05:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 16:05:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:05:23,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:23,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:23,422 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:23,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1024731985, now seen corresponding path program 1 times [2018-11-14 16:05:23,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:23,433 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 16:05:23,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:23,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:23,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 16:05:23,823 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 16:05:23,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 16:05:23,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2018-11-14 16:05:23,824 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2018-11-14 16:05:23,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-14 16:05:23,824 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 16:05:23,825 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 16:05:23,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 16:05:23,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-14 16:05:23,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 16:05:23,826 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 16:05:23,827 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 16:05:23,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 16:05:23,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume ~cond == 0bv32; {38#false} is VALID [2018-11-14 16:05:23,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 16:05:23,831 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 16:05:23,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:05:23,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:05:23,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:05:23,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:05:23,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:23,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:05:24,020 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 16:05:24,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:05:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:05:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:05:24,031 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 16:05:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:24,242 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2018-11-14 16:05:24,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:05:24,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 16:05:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:05:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-14 16:05:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:05:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2018-11-14 16:05:24,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2018-11-14 16:05:24,582 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 16:05:24,595 INFO L225 Difference]: With dead ends: 52 [2018-11-14 16:05:24,596 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:05:24,600 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 16:05:24,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:05:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:05:24,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:24,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:05:24,645 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:05:24,646 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:05:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:24,651 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 16:05:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 16:05:24,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:24,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:24,652 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:05:24,652 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:05:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:24,657 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 16:05:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 16:05:24,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:24,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:24,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:24,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:05:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 16:05:24,664 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2018-11-14 16:05:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:24,664 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 16:05:24,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:05:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 16:05:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:05:24,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:24,666 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 16:05:24,667 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:24,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:24,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1869615823, now seen corresponding path program 1 times [2018-11-14 16:05:24,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:24,668 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 16:05:24,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:24,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:25,145 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 16:05:25,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2018-11-14 16:05:25,387 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 16:05:25,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {241#true} assume true; {241#true} is VALID [2018-11-14 16:05:25,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {241#true} {241#true} #83#return; {241#true} is VALID [2018-11-14 16:05:25,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {241#true} call #t~ret8 := main(); {241#true} is VALID [2018-11-14 16:05:25,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {241#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {241#true} is VALID [2018-11-14 16:05:25,401 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 16:05:25,423 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 16:05:25,433 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 16:05:25,464 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 16:05:25,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {242#false} ~i~0 := 0bv32; {242#false} is VALID [2018-11-14 16:05:25,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#false} assume true; {242#false} is VALID [2018-11-14 16:05:25,466 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 16:05:25,466 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 16:05:25,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2018-11-14 16:05:25,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {242#false} assume ~cond == 0bv32; {242#false} is VALID [2018-11-14 16:05:25,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {242#false} assume !false; {242#false} is VALID [2018-11-14 16:05:25,470 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 16:05:25,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:05:25,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:05:25,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:05:25,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 16:05:25,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:25,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:05:25,654 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 16:05:25,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:05:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:05:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:05:25,655 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2018-11-14 16:05:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:27,370 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 16:05:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:05:27,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-14 16:05:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:05:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 16:05:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:05:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 16:05:27,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-14 16:05:27,746 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 16:05:27,748 INFO L225 Difference]: With dead ends: 48 [2018-11-14 16:05:27,748 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:05:27,749 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 16:05:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:05:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-11-14 16:05:27,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:27,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2018-11-14 16:05:27,788 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2018-11-14 16:05:27,789 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2018-11-14 16:05:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:27,792 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-14 16:05:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 16:05:27,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:27,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:27,793 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2018-11-14 16:05:27,793 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2018-11-14 16:05:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:27,797 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-14 16:05:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 16:05:27,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:27,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:27,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:27,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:05:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 16:05:27,802 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-14 16:05:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:27,802 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 16:05:27,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:05:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 16:05:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:05:27,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:27,804 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 16:05:27,804 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:27,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1249925920, now seen corresponding path program 1 times [2018-11-14 16:05:27,805 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:27,806 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 16:05:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:28,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:28,298 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 16:05:28,355 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 16:05:28,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:28,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:28,558 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 16:05:28,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-14 16:05:28,572 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:28,720 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 16:05:28,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:28,738 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 16:05:28,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:28,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:28,784 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 16:05:28,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:25 [2018-11-14 16:05:28,803 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:28,897 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 16:05:28,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:28,955 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 16:05:28,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:28,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:28,999 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 16:05:29,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2018-11-14 16:05:29,014 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:29,149 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 16:05:29,169 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 16:05:29,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:29,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:29,181 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 16:05:29,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-14 16:05:29,187 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:29,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 16:05:29,397 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 16:05:29,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 16:05:29,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #83#return; {466#true} is VALID [2018-11-14 16:05:29,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret8 := main(); {466#true} is VALID [2018-11-14 16:05:29,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {466#true} is VALID [2018-11-14 16:05:29,399 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 16:05:29,400 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 16:05:29,401 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 16:05:29,401 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 16:05:29,420 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 16:05:29,425 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 16:05:29,430 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 16:05:29,431 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 16:05:29,434 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 16:05:29,436 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 16:05:29,436 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 16:05:29,437 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 16:05:29,442 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 16:05:29,443 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 16:05:29,444 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 16:05:29,446 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 16:05:29,446 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 16:05:29,447 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 16:05:29,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 16:05:29,453 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 16:05:29,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:30,749 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 16:05:30,756 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 16:05:30,767 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,771 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 16:05:30,870 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,874 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 16:05:30,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:30,914 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,919 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:30,936 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 16:05:30,949 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-14 16:05:31,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:05:31,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:05:31,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:05:31,141 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 16:05:31,141 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:36, output treesize:43 [2018-11-14 16:05:31,150 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:31,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2018-11-14 16:05:31,235 INFO L273 TraceCheckUtils]: 23: Hoare triple {554#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {467#false} is VALID [2018-11-14 16:05:31,236 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 16:05:31,238 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 16:05:31,241 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 16:05:31,242 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 16:05:31,243 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 16:05:31,244 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 16:05:31,244 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 16:05:31,245 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 16:05:31,257 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 16:05:31,258 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 16:05:31,274 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 16:05:31,275 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 16:05:31,277 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 16:05:31,278 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 16:05:31,278 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 16:05:31,279 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 16:05:31,279 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 16:05:31,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {466#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {466#true} is VALID [2018-11-14 16:05:31,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret8 := main(); {466#true} is VALID [2018-11-14 16:05:31,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #83#return; {466#true} is VALID [2018-11-14 16:05:31,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2018-11-14 16:05:31,280 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 16:05:31,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {466#true} is VALID [2018-11-14 16:05:31,283 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 16:05:31,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:31,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 16:05:31,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 16:05:31,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:31,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:05:31,472 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 16:05:31,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:05:31,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:05:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:05:31,473 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2018-11-14 16:05:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:36,803 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2018-11-14 16:05:36,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:05:36,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-14 16:05:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:05:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-14 16:05:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:05:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2018-11-14 16:05:36,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2018-11-14 16:05:37,193 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 16:05:37,199 INFO L225 Difference]: With dead ends: 91 [2018-11-14 16:05:37,199 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 16:05:37,202 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 16:05:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 16:05:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2018-11-14 16:05:37,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:37,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 59 states. [2018-11-14 16:05:37,283 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 59 states. [2018-11-14 16:05:37,283 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 59 states. [2018-11-14 16:05:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:37,292 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-14 16:05:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-14 16:05:37,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:37,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:37,293 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 89 states. [2018-11-14 16:05:37,293 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 89 states. [2018-11-14 16:05:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:37,303 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-14 16:05:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-14 16:05:37,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:37,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:37,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:37,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:05:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2018-11-14 16:05:37,311 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 25 [2018-11-14 16:05:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:37,312 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2018-11-14 16:05:37,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:05:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2018-11-14 16:05:37,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:05:37,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:37,314 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 16:05:37,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:37,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1765177698, now seen corresponding path program 1 times [2018-11-14 16:05:37,315 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:37,316 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 16:05:37,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:37,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:37,729 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 16:05:37,740 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 16:05:37,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:37,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:37,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:37,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 16:05:37,863 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 16:05:37,873 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:37,878 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 16:05:37,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:37,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:37,951 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 16:05:37,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2018-11-14 16:05:37,965 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:38,052 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 16:05:38,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:38,158 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 16:05:38,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:38,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:38,200 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 16:05:38,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-14 16:05:38,213 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:38,376 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 16:05:38,382 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 16:05:38,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:38,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:38,392 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 16:05:38,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-14 16:05:38,397 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:38,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-14 16:05:38,528 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 16:05:38,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-14 16:05:38,529 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #83#return; {1005#true} is VALID [2018-11-14 16:05:38,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret8 := main(); {1005#true} is VALID [2018-11-14 16:05:38,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1005#true} is VALID [2018-11-14 16:05:38,545 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 16:05:38,552 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 16:05:38,553 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 16:05:38,554 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 16:05:38,556 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 16:05:38,557 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 16:05:38,559 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 16:05:38,559 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 16:05:38,561 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 16:05:38,563 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 16:05:38,564 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 16:05:38,565 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 16:05:38,566 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 16:05:38,567 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 16:05:38,567 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 16:05:38,568 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 16:05:38,569 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 16:05:38,575 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 16:05:38,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-14 16:05:38,578 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 16:05:38,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:39,154 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 16:05:39,161 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 16:05:39,173 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:39,178 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 16:05:39,275 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:39,278 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 16:05:39,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:39,295 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:39,332 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 16:05:39,337 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-14 16:05:39,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:05:39,555 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:05:39,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:05:39,660 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 16:05:39,661 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:61 [2018-11-14 16:05:39,667 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:39,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-14 16:05:39,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1006#false} is VALID [2018-11-14 16:05:39,782 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 16:05:39,783 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 16:05:39,784 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 16:05:39,786 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 16:05:39,787 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 16:05:39,787 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 16:05:39,788 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 16:05:39,789 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 16:05:39,800 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 16:05:39,801 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 16:05:39,815 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 16:05:39,829 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 16:05:39,832 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 16:05:39,833 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 16:05:39,834 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 16:05:39,834 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 16:05:39,836 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 16:05:39,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1005#true} is VALID [2018-11-14 16:05:39,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret8 := main(); {1005#true} is VALID [2018-11-14 16:05:39,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #83#return; {1005#true} is VALID [2018-11-14 16:05:39,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-14 16:05:39,837 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 16:05:39,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-14 16:05:39,839 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 16:05:39,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:39,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-11-14 16:05:39,842 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-14 16:05:39,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:39,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:05:40,018 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 16:05:40,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:05:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:05:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:05:40,019 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand 19 states. [2018-11-14 16:05:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:47,229 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2018-11-14 16:05:47,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:05:47,229 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-14 16:05:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:05:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 124 transitions. [2018-11-14 16:05:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:05:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 124 transitions. [2018-11-14 16:05:47,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 124 transitions. [2018-11-14 16:05:49,747 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 16:05:49,754 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:05:49,757 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 16:05:49,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:05:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 16:05:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 37. [2018-11-14 16:05:49,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:49,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 37 states. [2018-11-14 16:05:49,859 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 37 states. [2018-11-14 16:05:49,859 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 37 states. [2018-11-14 16:05:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:49,866 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2018-11-14 16:05:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-11-14 16:05:49,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:49,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:49,868 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 118 states. [2018-11-14 16:05:49,868 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 118 states. [2018-11-14 16:05:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:49,875 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2018-11-14 16:05:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-11-14 16:05:49,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:49,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:49,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:49,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 16:05:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 16:05:49,878 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2018-11-14 16:05:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:49,879 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 16:05:49,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:05:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 16:05:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 16:05:49,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:49,880 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 16:05:49,880 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:49,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash -5809233, now seen corresponding path program 1 times [2018-11-14 16:05:49,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:49,881 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 16:05:49,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:50,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:50,298 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 16:05:50,307 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 16:05:50,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:50,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:50,333 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 16:05:50,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-14 16:05:50,346 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:50,409 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 16:05:50,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:50,419 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 16:05:50,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:50,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:50,447 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 16:05:50,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-14 16:05:50,463 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:50,650 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 16:05:50,655 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 16:05:50,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:50,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:50,710 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 16:05:50,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-11-14 16:05:50,714 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:50,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-14 16:05:50,764 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 16:05:50,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-14 16:05:50,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2018-11-14 16:05:50,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret8 := main(); {1631#true} is VALID [2018-11-14 16:05:50,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1631#true} is VALID [2018-11-14 16:05:50,766 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 16:05:50,766 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 16:05:50,767 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 16:05:50,768 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 16:05:50,769 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 16:05:50,770 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 16:05:50,771 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 16:05:50,774 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 16:05:50,776 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 16:05:50,778 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 16:05:50,779 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 16:05:50,796 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 16:05:50,797 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 16:05:50,798 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 16:05:50,799 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 16:05:50,801 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 16:05:50,801 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 16:05:50,802 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 16:05:50,803 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 16:05:50,804 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 16:05:50,805 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 16:05:50,806 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 16:05:50,809 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 16:05:50,811 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 16:05:50,812 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 16:05:50,812 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 16:05:50,813 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 16:05:50,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-14 16:05:50,816 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 16:05:50,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:51,225 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 16:05:51,232 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 16:05:51,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:51,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:51,349 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 16:05:51,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:51,358 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 16:05:51,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:51,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:05:51,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:05:51,433 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 16:05:51,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:27 [2018-11-14 16:05:51,440 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:51,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {1632#false} assume !false; {1632#false} is VALID [2018-11-14 16:05:51,534 INFO L273 TraceCheckUtils]: 32: Hoare triple {1747#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1632#false} is VALID [2018-11-14 16:05:51,535 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 16:05:51,536 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 16:05:51,537 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 16:05:51,538 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 16:05:51,729 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 16:05:51,730 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 16:05:51,731 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 16:05:51,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-14 16:05:51,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {1631#true} assume !(~cond == 0bv32); {1631#true} is VALID [2018-11-14 16:05:51,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {1631#true} ~cond := #in~cond; {1631#true} is VALID [2018-11-14 16:05:51,732 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 16:05:51,733 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 16:05:51,733 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 16:05:51,735 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 16:05:51,735 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 16:05:51,736 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 16:05:51,736 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 16:05:51,755 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 16:05:51,756 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 16:05:51,758 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 16:05:51,758 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 16:05:51,759 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 16:05:51,760 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 16:05:51,763 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 16:05:51,763 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 16:05:51,764 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 16:05:51,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {1631#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1631#true} is VALID [2018-11-14 16:05:51,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {1631#true} call #t~ret8 := main(); {1631#true} is VALID [2018-11-14 16:05:51,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1631#true} {1631#true} #83#return; {1631#true} is VALID [2018-11-14 16:05:51,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {1631#true} assume true; {1631#true} is VALID [2018-11-14 16:05:51,765 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 16:05:51,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {1631#true} call ULTIMATE.init(); {1631#true} is VALID [2018-11-14 16:05:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:05:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-14 16:05:51,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-14 16:05:51,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:51,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:05:52,186 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 16:05:52,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:05:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:05:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:05:52,188 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-11-14 16:06:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:06:49,986 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2018-11-14 16:06:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:06:49,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-11-14 16:06:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:06:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:06:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2018-11-14 16:06:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:06:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2018-11-14 16:06:49,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 135 transitions. [2018-11-14 16:06:50,498 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 16:06:50,503 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:06:50,503 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 16:06:50,504 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 16:06:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 16:06:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 68. [2018-11-14 16:06:50,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:06:50,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 68 states. [2018-11-14 16:06:50,623 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 68 states. [2018-11-14 16:06:50,623 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 68 states. [2018-11-14 16:06:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:06:50,630 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2018-11-14 16:06:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2018-11-14 16:06:50,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:06:50,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:06:50,631 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 118 states. [2018-11-14 16:06:50,631 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 118 states. [2018-11-14 16:06:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:06:50,636 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2018-11-14 16:06:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2018-11-14 16:06:50,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:06:50,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:06:50,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:06:50,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:06:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:06:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-11-14 16:06:50,639 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 34 [2018-11-14 16:06:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:06:50,640 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-11-14 16:06:50,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:06:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-11-14 16:06:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 16:06:50,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:06:50,641 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 16:06:50,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:06:50,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:06:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash 213045485, now seen corresponding path program 1 times [2018-11-14 16:06:50,642 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:06:50,642 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 16:06:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:06:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:06:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:06:50,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:06:50,970 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 16:06:50,975 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 16:06:50,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:50,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:51,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:51,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 16:06:51,062 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 16:06:51,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:51,076 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 16:06:51,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:51,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:51,108 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 16:06:51,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-14 16:06:51,119 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:06:51,311 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 16:06:51,316 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 16:06:51,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:51,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:51,331 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 16:06:51,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-14 16:06:51,336 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:06:51,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 16:06:51,638 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 16:06:51,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 16:06:51,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #83#return; {2339#true} is VALID [2018-11-14 16:06:51,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret8 := main(); {2339#true} is VALID [2018-11-14 16:06:51,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2339#true} is VALID [2018-11-14 16:06:51,642 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 16:06:51,643 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 16:06:51,648 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 16:06:51,650 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 16:06:51,650 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 16:06:51,651 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 16:06:51,654 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 16:06:51,655 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 16:06:51,658 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 16:06:51,659 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 16:06:51,659 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 16:06:51,660 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 16:06:51,660 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 16:06:51,661 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 16:06:51,662 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 16:06:51,664 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 16:06:51,665 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 16:06:51,665 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 16:06:51,666 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 16:06:51,666 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 16:06:51,667 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 16:06:51,668 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 16:06:51,669 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 16:06:51,671 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 16:06:51,672 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 16:06:51,673 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 16:06:51,674 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 16:06:51,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 16:06:51,679 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 16:06:51,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:06:52,059 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 16:06:52,066 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 16:06:52,134 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 16:06:52,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:52,157 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 16:06:52,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 16:06:52,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:06:52,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:06:52,244 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 16:06:52,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:39 [2018-11-14 16:06:52,252 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:06:52,432 INFO L273 TraceCheckUtils]: 33: Hoare triple {2340#false} assume !false; {2340#false} is VALID [2018-11-14 16:06:52,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {2455#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {2340#false} is VALID [2018-11-14 16:06:52,433 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 16:06:52,435 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 16:06:52,436 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 16:06:52,436 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 16:06:52,648 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 16:06:52,655 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 16:06:52,657 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 16:06:52,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 16:06:52,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {2339#true} assume !(~cond == 0bv32); {2339#true} is VALID [2018-11-14 16:06:52,657 INFO L273 TraceCheckUtils]: 22: Hoare triple {2339#true} ~cond := #in~cond; {2339#true} is VALID [2018-11-14 16:06:52,657 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 16:06:52,658 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 16:06:52,660 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 16:06:52,662 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 16:06:52,662 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 16:06:52,663 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 16:06:52,664 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 16:06:52,680 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 16:06:52,683 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 16:06:52,685 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 16:06:52,686 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 16:06:52,687 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 16:06:52,687 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 16:06:52,688 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 16:06:52,688 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 16:06:52,689 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 16:06:52,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {2339#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2339#true} is VALID [2018-11-14 16:06:52,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {2339#true} call #t~ret8 := main(); {2339#true} is VALID [2018-11-14 16:06:52,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2339#true} {2339#true} #83#return; {2339#true} is VALID [2018-11-14 16:06:52,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {2339#true} assume true; {2339#true} is VALID [2018-11-14 16:06:52,691 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 16:06:52,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {2339#true} call ULTIMATE.init(); {2339#true} is VALID [2018-11-14 16:06:52,693 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 16:06:52,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:06:52,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 16:06:52,696 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-11-14 16:06:52,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:06:52,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:06:53,120 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 16:06:53,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:06:53,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:06:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:06:53,121 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 20 states. [2018-11-14 16:07:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:07:03,679 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2018-11-14 16:07:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:07:03,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2018-11-14 16:07:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:07:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:07:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 136 transitions. [2018-11-14 16:07:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:07:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 136 transitions. [2018-11-14 16:07:03,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 136 transitions.