java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/sum_array_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:24:17,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:24:17,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:24:17,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:24:17,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:24:17,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:24:17,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:24:17,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:24:17,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:24:17,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:24:17,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:24:17,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:24:17,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:24:17,904 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:24:17,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:24:17,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:24:17,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:24:17,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:24:17,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:24:17,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:24:17,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:24:17,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:24:17,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:24:17,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:24:17,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:24:17,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:24:17,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:24:17,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:24:17,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:24:17,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:24:17,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:24:17,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:24:17,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:24:17,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:24:17,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:24:17,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:24:17,945 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:24:17,962 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:24:17,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:24:17,963 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:24:17,963 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:24:17,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:24:17,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:24:17,964 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:24:17,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:24:17,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:24:17,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:24:17,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:24:17,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:24:17,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:24:17,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:24:17,966 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:24:17,966 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:24:17,967 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:24:17,967 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:24:17,967 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:24:17,967 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:24:17,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:24:17,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:24:17,968 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:24:17,968 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:24:17,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:17,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:24:17,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:24:17,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:24:17,969 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:24:17,969 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:24:17,969 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:24:17,969 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:24:17,970 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:24:18,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:24:18,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:24:18,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:24:18,037 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:24:18,037 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:24:18,038 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array_false-unreach-call.i [2018-11-23 11:24:18,107 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb2ef2fa/78bcc7d91bb94ad6b79c9fa0c92b4f16/FLAG93c132842 [2018-11-23 11:24:18,570 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:24:18,571 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_false-unreach-call.i [2018-11-23 11:24:18,577 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb2ef2fa/78bcc7d91bb94ad6b79c9fa0c92b4f16/FLAG93c132842 [2018-11-23 11:24:18,949 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feb2ef2fa/78bcc7d91bb94ad6b79c9fa0c92b4f16 [2018-11-23 11:24:18,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:24:18,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:24:18,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:18,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:24:18,966 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:24:18,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:18" (1/1) ... [2018-11-23 11:24:18,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355a8376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:18, skipping insertion in model container [2018-11-23 11:24:18,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:24:18" (1/1) ... [2018-11-23 11:24:18,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:24:19,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:24:19,233 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:19,239 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:24:19,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:24:19,296 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:24:19,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19 WrapperNode [2018-11-23 11:24:19,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:24:19,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:19,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:24:19,298 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:24:19,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:24:19,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:24:19,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:24:19,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:24:19,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... [2018-11-23 11:24:19,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:24:19,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:24:19,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:24:19,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:24:19,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:24:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:24:19,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:24:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:24:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:24:19,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:24:19,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:24:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:24:19,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:24:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:24:19,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:24:19,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:24:19,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:24:20,134 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:24:20,135 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:24:20,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:20 BoogieIcfgContainer [2018-11-23 11:24:20,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:24:20,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:24:20,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:24:20,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:24:20,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:24:18" (1/3) ... [2018-11-23 11:24:20,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d653485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:20, skipping insertion in model container [2018-11-23 11:24:20,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:24:19" (2/3) ... [2018-11-23 11:24:20,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d653485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:24:20, skipping insertion in model container [2018-11-23 11:24:20,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:24:20" (3/3) ... [2018-11-23 11:24:20,145 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_false-unreach-call.i [2018-11-23 11:24:20,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:24:20,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:24:20,185 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:24:20,219 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:24:20,220 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:24:20,220 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:24:20,220 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:24:20,220 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:24:20,220 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:24:20,221 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:24:20,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:24:20,221 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:24:20,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 11:24:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:24:20,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:20,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:20,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:20,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 415311520, now seen corresponding path program 1 times [2018-11-23 11:24:20,260 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:20,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:20,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:20,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:20,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 11:24:20,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 11:24:20,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 11:24:20,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-23 11:24:20,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret12 := main(); {33#true} is VALID [2018-11-23 11:24:20,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));havoc ~i~0;~i~0 := 0bv32; {33#true} is VALID [2018-11-23 11:24:20,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 11:24:20,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 11:24:20,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !~bvult32(~i~0, ~M~0); {34#false} is VALID [2018-11-23 11:24:20,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 11:24:20,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !~bvult32(~i~0, ~M~0); {34#false} is VALID [2018-11-23 11:24:20,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 11:24:20,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!~bvult32(~i~0, ~M~0);call #t~mem11 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {34#false} is VALID [2018-11-23 11:24:20,640 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 11:24:20,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 11:24:20,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 11:24:20,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 11:24:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:20,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:20,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:20,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:24:20,657 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:24:20,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:20,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:24:20,856 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-23 11:24:20,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:24:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:24:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:20,868 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 11:24:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:20,995 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 11:24:20,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:24:20,996 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 11:24:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 11:24:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:24:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 11:24:21,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-23 11:24:21,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:21,314 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:24:21,314 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:24:21,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:24:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:24:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:24:21,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:21,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:24:21,370 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:24:21,371 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:24:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:21,375 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:24:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:24:21,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:21,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:21,376 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:24:21,376 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:24:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:21,381 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 11:24:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:24:21,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:21,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:21,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:21,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:24:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:24:21,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 11:24:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:21,387 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:24:21,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:24:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:24:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:24:21,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:21,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:21,389 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:21,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1687882214, now seen corresponding path program 1 times [2018-11-23 11:24:21,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:21,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:21,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:21,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 11:24:21,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {237#true} is VALID [2018-11-23 11:24:21,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 11:24:21,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #77#return; {237#true} is VALID [2018-11-23 11:24:21,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret12 := main(); {237#true} is VALID [2018-11-23 11:24:21,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));havoc ~i~0;~i~0 := 0bv32; {237#true} is VALID [2018-11-23 11:24:21,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {237#true} assume !~bvult32(~i~0, ~M~0); {237#true} is VALID [2018-11-23 11:24:21,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#true} ~i~0 := 0bv32; {263#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:24:21,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {263#(= main_~i~0 (_ bv0 32))} assume !~bvult32(~i~0, ~M~0); {267#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-23 11:24:21,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {267#(not (bvult (_ bv0 32) main_~M~0))} ~i~0 := 0bv32; {267#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-23 11:24:21,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#(not (bvult (_ bv0 32) main_~M~0))} assume !~bvult32(~i~0, ~M~0); {267#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-23 11:24:21,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#(not (bvult (_ bv0 32) main_~M~0))} ~i~0 := 0bv32; {267#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-23 11:24:21,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#(not (bvult (_ bv0 32) main_~M~0))} assume !!~bvult32(~i~0, ~M~0);call #t~mem11 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {238#false} is VALID [2018-11-23 11:24:21,835 INFO L256 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {238#false} is VALID [2018-11-23 11:24:21,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 11:24:21,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume 0bv32 == ~cond; {238#false} is VALID [2018-11-23 11:24:21,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 11:24:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:24:21,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:24:21,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:24:21,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:24:21,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 11:24:21,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:21,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:24:22,090 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-23 11:24:22,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:24:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:24:22,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:24:22,091 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2018-11-23 11:24:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:22,739 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-23 11:24:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:24:22,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 11:24:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:24:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:24:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:24:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 11:24:22,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 11:24:22,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:22,944 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:24:22,945 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:24:22,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:24:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:24:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-23 11:24:22,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:22,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2018-11-23 11:24:22,974 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2018-11-23 11:24:22,974 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2018-11-23 11:24:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:22,978 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:24:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:24:22,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:22,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:22,980 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2018-11-23 11:24:22,980 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2018-11-23 11:24:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:22,983 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 11:24:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 11:24:22,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:22,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:22,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:22,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:24:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 11:24:22,988 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2018-11-23 11:24:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:22,988 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 11:24:22,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:24:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 11:24:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:24:22,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:22,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:22,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:22,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash -825329612, now seen corresponding path program 1 times [2018-11-23 11:24:22,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:22,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:23,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:24:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:23,199 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #77#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));havoc ~i~0;~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~i~0, ~M~0);call write~intINTTYPE4(#t~nondet2, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet2; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv1 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !~bvult32(~i~0, ~M~0); VAL [main_~i~0=(_ bv1 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~i~0, ~M~0);call write~intINTTYPE4(#t~nondet4, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet4; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; VAL [main_~i~0=(_ bv1 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !~bvult32(~i~0, ~M~0); VAL [main_~i~0=(_ bv1 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~i~0, ~M~0);call #t~mem6 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), ~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7;havoc #t~mem6; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; VAL [main_~i~0=(_ bv1 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !~bvult32(~i~0, ~M~0); VAL [main_~i~0=(_ bv1 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~i~0, ~M~0);call #t~mem11 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [main_~i~0=(_ bv0 32), main_~M~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem10|=(_ bv10 32), |main_#t~mem11|=(_ bv19 32), |main_#t~mem9|=(_ bv9 32), |main_~#A~0.base|=(_ bv2147483650 32), |main_~#A~0.offset|=(_ bv0 32), |main_~#B~0.base|=(_ bv3 32), |main_~#B~0.offset|=(_ bv0 32), |main_~#C~0.base|=(_ bv2 32), |main_~#C~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L16] havoc ~i~0; [L18] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18-L19] assume !!~bvult32(~i~0, ~M~0); [L19] call write~intINTTYPE4(#t~nondet2, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L19] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L18-L19] assume !~bvult32(~i~0, ~M~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21-L22] assume !!~bvult32(~i~0, ~M~0); [L22] call write~intINTTYPE4(#t~nondet4, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L22] havoc #t~nondet4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21] #t~post3 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post3); [L21] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21-L22] assume !~bvult32(~i~0, ~M~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24-L25] assume !!~bvult32(~i~0, ~M~0); [L25] call #t~mem6 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L25] call #t~mem7 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L25] call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), ~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L25] havoc #t~mem7; [L25] havoc #t~mem6; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24] #t~post5 := ~i~0; [L24] ~i~0 := ~bvadd32(1bv32, #t~post5); [L24] havoc #t~post5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24-L25] assume !~bvult32(~i~0, ~M~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L27] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L27-L28] assume !!~bvult32(~i~0, ~M~0); [L28] call #t~mem11 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L28] call #t~mem9 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L28] call #t~mem10 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem10=10bv32, #t~mem11=19bv32, #t~mem9=9bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L28] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L16] havoc ~i~0; [L18] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18-L19] assume !!~bvult32(~i~0, ~M~0); [L19] call write~intINTTYPE4(#t~nondet2, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L19] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L18-L19] assume !~bvult32(~i~0, ~M~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21-L22] assume !!~bvult32(~i~0, ~M~0); [L22] call write~intINTTYPE4(#t~nondet4, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L22] havoc #t~nondet4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21] #t~post3 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post3); [L21] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21-L22] assume !~bvult32(~i~0, ~M~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24-L25] assume !!~bvult32(~i~0, ~M~0); [L25] call #t~mem6 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L25] call #t~mem7 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L25] call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), ~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L25] havoc #t~mem7; [L25] havoc #t~mem6; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24] #t~post5 := ~i~0; [L24] ~i~0 := ~bvadd32(1bv32, #t~post5); [L24] havoc #t~post5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24-L25] assume !~bvult32(~i~0, ~M~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L27] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L27-L28] assume !!~bvult32(~i~0, ~M~0); [L28] call #t~mem11 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L28] call #t~mem9 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); [L28] call #t~mem10 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem10=10bv32, #t~mem11=19bv32, #t~mem9=9bv32, ~#A~0.base=2147483650bv32, ~#A~0.offset=0bv32, ~#B~0.base=3bv32, ~#B~0.offset=0bv32, ~#C~0.base=2bv32, ~#C~0.offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L28] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5-L7] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L16] havoc ~i~0; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18-L19] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L19] FCALL call write~intINTTYPE4(#t~nondet2, { base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L18-L19] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21-L22] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L22] FCALL call write~intINTTYPE4(#t~nondet4, { base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L22] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21] #t~post3 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post3); [L21] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21-L22] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24-L25] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), { base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] havoc #t~mem7; [L25] havoc #t~mem6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24] #t~post5 := ~i~0; [L24] ~i~0 := ~bvadd32(1bv32, #t~post5); [L24] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24-L25] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L27] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L27-L28] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L28] FCALL call #t~mem11 := read~intINTTYPE4({ base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=10bv32, #t~mem11=19bv32, #t~mem9=9bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L28] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L16] havoc ~i~0; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18-L19] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L19] FCALL call write~intINTTYPE4(#t~nondet2, { base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L18-L19] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21-L22] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L22] FCALL call write~intINTTYPE4(#t~nondet4, { base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L22] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21] #t~post3 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post3); [L21] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21-L22] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24-L25] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), { base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] havoc #t~mem7; [L25] havoc #t~mem6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24] #t~post5 := ~i~0; [L24] ~i~0 := ~bvadd32(1bv32, #t~post5); [L24] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24-L25] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L27] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L27-L28] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L28] FCALL call #t~mem11 := read~intINTTYPE4({ base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=10bv32, #t~mem11=19bv32, #t~mem9=9bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L28] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L16] havoc ~i~0; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18-L19] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L19] FCALL call write~intINTTYPE4(#t~nondet2, { base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L18-L19] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21-L22] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L22] FCALL call write~intINTTYPE4(#t~nondet4, { base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L22] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21] #t~post3 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post3); [L21] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21-L22] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24-L25] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), { base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] havoc #t~mem7; [L25] havoc #t~mem6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24] #t~post5 := ~i~0; [L24] ~i~0 := ~bvadd32(1bv32, #t~post5); [L24] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24-L25] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L27] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L27-L28] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L28] FCALL call #t~mem11 := read~intINTTYPE4({ base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=10bv32, #t~mem11=19bv32, #t~mem9=9bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L28] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(~bvmul32(4bv32, ~M~0)); [L16] havoc ~i~0; [L18] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18-L19] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L19] FCALL call write~intINTTYPE4(#t~nondet2, { base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L19] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L18] #t~post1 := ~i~0; [L18] ~i~0 := ~bvadd32(1bv32, #t~post1); [L18] havoc #t~post1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L18-L19] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21-L22] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L22] FCALL call write~intINTTYPE4(#t~nondet4, { base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L22] havoc #t~nondet4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L21] #t~post3 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post3); [L21] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L21-L22] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24-L25] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] FCALL call write~intINTTYPE4(~bvadd32(#t~mem6, #t~mem7), { base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L25] havoc #t~mem7; [L25] havoc #t~mem6; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L24] #t~post5 := ~i~0; [L24] ~i~0 := ~bvadd32(1bv32, #t~post5); [L24] havoc #t~post5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L24-L25] COND TRUE !~bvult32(~i~0, ~M~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=1bv32, ~M~0=1bv32] [L27] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L27-L28] COND FALSE !(!~bvult32(~i~0, ~M~0)) [L28] FCALL call #t~mem11 := read~intINTTYPE4({ base: ~#C~0!base, offset: ~bvadd32(~#C~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~#A~0!base, offset: ~bvadd32(~#A~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); [L28] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#B~0!base, offset: ~bvadd32(~#B~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=10bv32, #t~mem11=19bv32, #t~mem9=9bv32, ~#A~0!base=2147483650bv32, ~#A~0!offset=0bv32, ~#B~0!base=3bv32, ~#B~0!offset=0bv32, ~#C~0!base=2bv32, ~#C~0!offset=0bv32, ~i~0=0bv32, ~M~0=1bv32] [L28] CALL call __VERIFIER_assert((if #t~mem11 == ~bvsub32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L6] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L14] unsigned int M = __VERIFIER_nondet_uint(); [L15] int A[M], B[M], C[M]; [L16] unsigned int i; [L18] i=0 VAL [A={-2147483646:0}, B={3:0}, C={2:0}, i=0, M=1] [L18] COND TRUE i