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/ldv-regression/test25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:52,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:52,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:52,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:52,784 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:52,785 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:52,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:52,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:52,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:52,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:52,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:52,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:52,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:52,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:52,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:52,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:52,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:52,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:52,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:52,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:52,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:52,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:52,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:52,816 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:52,816 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:52,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:52,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:52,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:52,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:52,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:52,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:52,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:52,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:52,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:52,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:52,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:52,828 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:07:52,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:52,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:52,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:52,848 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:52,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:52,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:52,849 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:52,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:52,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:52,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:52,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:52,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:52,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:52,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:52,851 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:52,851 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:52,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:52,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:52,852 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:52,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:52,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:52,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:52,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:52,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:52,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:52,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:52,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:52,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:52,854 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:52,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:52,854 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:52,854 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:52,855 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:52,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:52,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:52,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:52,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:52,920 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:52,921 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c [2018-11-23 11:07:52,980 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d0bbfed/07adc379706a41cd8d416ce30f3fad08/FLAG60cd95ade [2018-11-23 11:07:53,457 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:53,458 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25_true-unreach-call.c [2018-11-23 11:07:53,467 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d0bbfed/07adc379706a41cd8d416ce30f3fad08/FLAG60cd95ade [2018-11-23 11:07:53,793 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d0bbfed/07adc379706a41cd8d416ce30f3fad08 [2018-11-23 11:07:53,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:53,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:53,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:53,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:53,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:53,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:53" (1/1) ... [2018-11-23 11:07:53,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f0128b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:53, skipping insertion in model container [2018-11-23 11:07:53,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:53" (1/1) ... [2018-11-23 11:07:53,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:53,856 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:54,166 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:54,183 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:54,213 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:54,237 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:54,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54 WrapperNode [2018-11-23 11:07:54,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:54,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:54,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:54,239 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:54,247 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:07:54" (1/1) ... [2018-11-23 11:07:54,258 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:07:54" (1/1) ... [2018-11-23 11:07:54,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:54,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:54,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:54,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:54,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (1/1) ... [2018-11-23 11:07:54,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:54,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:54,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:54,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:54,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (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:07:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:07:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 11:07:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 11:07:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:07:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:07:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:55,159 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:55,159 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:07:55,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:55 BoogieIcfgContainer [2018-11-23 11:07:55,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:55,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:55,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:55,165 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:55,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:53" (1/3) ... [2018-11-23 11:07:55,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716fee99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:55, skipping insertion in model container [2018-11-23 11:07:55,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:54" (2/3) ... [2018-11-23 11:07:55,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716fee99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:55, skipping insertion in model container [2018-11-23 11:07:55,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:55" (3/3) ... [2018-11-23 11:07:55,169 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_true-unreach-call.c [2018-11-23 11:07:55,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:55,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:55,214 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:55,247 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:55,248 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:55,248 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:55,248 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:55,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:55,249 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:55,249 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:55,249 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:55,249 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:07:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:07:55,273 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:55,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:55,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:55,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1170433446, now seen corresponding path program 1 times [2018-11-23 11:07:55,289 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:55,289 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:07:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:55,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:55,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:07:55,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 11:07:55,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:07:55,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #57#return; {27#true} is VALID [2018-11-23 11:07:55,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret13 := main(); {27#true} is VALID [2018-11-23 11:07:55,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 11:07:55,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 11:07:55,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {28#false} is VALID [2018-11-23 11:07:55,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {28#false} is VALID [2018-11-23 11:07:55,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume !true; {28#false} is VALID [2018-11-23 11:07:55,674 INFO L256 TraceCheckUtils]: 10: Hoare triple {28#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {28#false} is VALID [2018-11-23 11:07:55,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {28#false} is VALID [2018-11-23 11:07:55,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume true; {28#false} is VALID [2018-11-23 11:07:55,675 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {28#false} {28#false} #61#return; {28#false} is VALID [2018-11-23 11:07:55,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {28#false} is VALID [2018-11-23 11:07:55,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:07:55,679 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:07:55,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:55,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:55,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:07:55,694 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:07:55,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:55,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:07:55,797 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-23 11:07:55,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:07:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:07:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:07:55,807 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 11:07:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:55,937 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-11-23 11:07:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:07:55,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:07:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:07:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 11:07:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:07:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 11:07:55,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-23 11:07:56,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:56,229 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:07:56,229 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:07:56,233 INFO L631 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-23 11:07:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:07:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:07:56,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:56,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:56,289 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:56,289 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,293 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:07:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:07:56,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:56,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:56,294 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:56,294 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:56,298 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:07:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:07:56,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:56,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:56,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:56,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:07:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:07:56,304 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-11-23 11:07:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:56,305 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:07:56,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:07:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:07:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:07:56,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:56,307 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:07:56,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:56,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1596126575, now seen corresponding path program 1 times [2018-11-23 11:07:56,308 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:56,308 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:07:56,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:56,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:56,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2018-11-23 11:07:56,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {195#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {195#true} is VALID [2018-11-23 11:07:56,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2018-11-23 11:07:56,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #57#return; {195#true} is VALID [2018-11-23 11:07:56,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret13 := main(); {195#true} is VALID [2018-11-23 11:07:56,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {215#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:07:56,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#(= main_~j~0 (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {196#false} is VALID [2018-11-23 11:07:56,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {196#false} is VALID [2018-11-23 11:07:56,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {196#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {196#false} is VALID [2018-11-23 11:07:56,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {196#false} is VALID [2018-11-23 11:07:56,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {196#false} is VALID [2018-11-23 11:07:56,506 INFO L256 TraceCheckUtils]: 11: Hoare triple {196#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {196#false} is VALID [2018-11-23 11:07:56,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {196#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {196#false} is VALID [2018-11-23 11:07:56,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {196#false} assume true; {196#false} is VALID [2018-11-23 11:07:56,507 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {196#false} {196#false} #61#return; {196#false} is VALID [2018-11-23 11:07:56,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {196#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {196#false} is VALID [2018-11-23 11:07:56,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {196#false} assume !false; {196#false} is VALID [2018-11-23 11:07:56,509 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:07:56,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:56,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:56,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:07:56,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:07:56,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:56,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:07:56,666 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:07:56,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:07:56,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:07:56,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:07:56,668 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-23 11:07:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:57,200 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:07:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:07:57,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:07:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:07:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:07:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:07:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:07:57,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:07:57,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:57,306 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:07:57,306 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:07:57,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:07:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:07:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 11:07:57,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:57,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 11:07:57,323 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 11:07:57,323 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 11:07:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:57,326 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:07:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:07:57,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:57,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:57,327 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 11:07:57,327 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 11:07:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:57,330 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:07:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:07:57,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:57,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:57,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:57,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:07:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:07:57,333 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 11:07:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:57,334 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:07:57,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:07:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:07:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:07:57,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:57,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:57,335 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:57,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash -450230899, now seen corresponding path program 1 times [2018-11-23 11:07:57,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:57,337 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:07:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:57,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:57,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-23 11:07:57,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-23 11:07:57,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 11:07:57,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #57#return; {366#true} is VALID [2018-11-23 11:07:57,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret13 := main(); {366#true} is VALID [2018-11-23 11:07:57,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {386#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:07:57,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(= main_~j~0 (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {386#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:07:57,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#(= main_~j~0 (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {393#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:57,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {367#false} is VALID [2018-11-23 11:07:57,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {367#false} is VALID [2018-11-23 11:07:57,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {367#false} is VALID [2018-11-23 11:07:57,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {367#false} is VALID [2018-11-23 11:07:57,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {367#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {367#false} is VALID [2018-11-23 11:07:57,553 INFO L256 TraceCheckUtils]: 13: Hoare triple {367#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {367#false} is VALID [2018-11-23 11:07:57,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {367#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {367#false} is VALID [2018-11-23 11:07:57,554 INFO L273 TraceCheckUtils]: 15: Hoare triple {367#false} assume true; {367#false} is VALID [2018-11-23 11:07:57,554 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {367#false} {367#false} #61#return; {367#false} is VALID [2018-11-23 11:07:57,555 INFO L273 TraceCheckUtils]: 17: Hoare triple {367#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {367#false} is VALID [2018-11-23 11:07:57,555 INFO L273 TraceCheckUtils]: 18: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-23 11:07:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:57,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:57,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-23 11:07:57,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {367#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {367#false} is VALID [2018-11-23 11:07:57,668 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {366#true} {367#false} #61#return; {367#false} is VALID [2018-11-23 11:07:57,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 11:07:57,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {366#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {366#true} is VALID [2018-11-23 11:07:57,669 INFO L256 TraceCheckUtils]: 13: Hoare triple {367#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {366#true} is VALID [2018-11-23 11:07:57,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {367#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {367#false} is VALID [2018-11-23 11:07:57,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {367#false} is VALID [2018-11-23 11:07:57,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {367#false} is VALID [2018-11-23 11:07:57,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {367#false} is VALID [2018-11-23 11:07:57,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(bvslt main_~j~0 (_ bv10 32))} assume !~bvslt32(~j~0, 10bv32); {367#false} is VALID [2018-11-23 11:07:57,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {457#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-23 11:07:57,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:07:57,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:07:57,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret13 := main(); {366#true} is VALID [2018-11-23 11:07:57,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #57#return; {366#true} is VALID [2018-11-23 11:07:57,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 11:07:57,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-23 11:07:57,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-23 11:07:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:57,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:07:57,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:07:57,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:57,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:07:57,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:57,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:07:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:07:57,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:07:57,792 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 11:07:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:58,416 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 11:07:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:07:58,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:07:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:07:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 11:07:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:07:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 11:07:58,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2018-11-23 11:07:58,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:58,519 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:07:58,519 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:07:58,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:07:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:07:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:07:58,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:58,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:07:58,532 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:07:58,532 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:07:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:58,535 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:07:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:07:58,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:58,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:58,536 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:07:58,537 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:07:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:58,539 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:07:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:07:58,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:58,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:58,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:58,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:07:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 11:07:58,542 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2018-11-23 11:07:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:58,543 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 11:07:58,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:07:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:07:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:07:58,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:58,544 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:58,544 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:58,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1321818343, now seen corresponding path program 2 times [2018-11-23 11:07:58,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:58,545 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:58,565 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:07:58,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:07:58,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:07:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:58,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:59,034 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:07:59,208 INFO L478 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 36 treesize of output 30 [2018-11-23 11:07:59,233 INFO L478 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 30 treesize of output 9 [2018-11-23 11:07:59,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:59,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:59,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:59,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:12 [2018-11-23 11:07:59,287 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:59,287 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_14]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))))) (and (bvsgt .cse0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt v_main_~i~0_14 (_ bv10 32)) (bvsge v_main_~i~0_14 (_ bv0 32)) (= |main_#t~mem10| .cse0))) [2018-11-23 11:07:59,288 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsgt |main_#t~mem10| (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (= |main_#t~mem10| (bvadd main_~i~0 (_ bv10 32)))) [2018-11-23 11:07:59,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-23 11:07:59,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-23 11:07:59,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-23 11:07:59,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #57#return; {632#true} is VALID [2018-11-23 11:07:59,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret13 := main(); {632#true} is VALID [2018-11-23 11:07:59,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,376 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume !~bvslt32(~j~0, 10bv32); {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} is VALID [2018-11-23 11:07:59,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#(and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|))} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {683#(and (= |main_~#cont~0.offset| (_ bv0 32)) (bvsge main_~i~0 (_ bv0 32)) (= (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32)) main_~pa~0.offset) (= (_ bv0 32) |main_~#array~0.offset|) (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32))) |main_#t~mem8|) (= |main_~#array~0.base| main_~pa~0.base) (bvslt main_~i~0 (_ bv10 32)))} is VALID [2018-11-23 11:07:59,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {683#(and (= |main_~#cont~0.offset| (_ bv0 32)) (bvsge main_~i~0 (_ bv0 32)) (= (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32)) main_~pa~0.offset) (= (_ bv0 32) |main_~#array~0.offset|) (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4 32))) |main_#t~mem8|) (= |main_~#array~0.base| main_~pa~0.base) (bvslt main_~i~0 (_ bv10 32)))} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {687#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_~#cont~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:07:59,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {687#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv8 32) v_main_~i~0_14) (_ bv4 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_~#cont~0.offset| (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {691#(and (bvsgt |main_#t~mem10| (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (= (bvadd |main_#t~mem10| (_ bv4294967286 32)) main_~i~0))} is VALID [2018-11-23 11:07:59,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {691#(and (bvsgt |main_#t~mem10| (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (= (bvadd |main_#t~mem10| (_ bv4294967286 32)) main_~i~0))} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {633#false} is VALID [2018-11-23 11:07:59,605 INFO L256 TraceCheckUtils]: 19: Hoare triple {633#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {633#false} is VALID [2018-11-23 11:07:59,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {633#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {633#false} is VALID [2018-11-23 11:07:59,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-23 11:07:59,606 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {633#false} {633#false} #61#return; {633#false} is VALID [2018-11-23 11:07:59,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {633#false} is VALID [2018-11-23 11:07:59,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-23 11:07:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:07:59,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:59,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:59,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:07:59,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 11:07:59,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:59,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:07:59,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:59,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:07:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:07:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:07:59,922 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2018-11-23 11:08:00,719 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-23 11:08:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,950 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 11:08:00,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:08:00,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 11:08:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:08:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:08:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:08:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:08:00,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 11:08:01,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:01,450 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:08:01,450 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:08:01,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:08:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:08:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:08:01,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:01,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:01,483 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:01,484 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:01,487 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:08:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:08:01,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:01,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:01,488 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:01,488 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:01,491 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:08:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:08:01,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:01,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:01,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:01,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:08:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 11:08:01,494 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2018-11-23 11:08:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:01,495 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 11:08:01,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:08:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:08:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:08:01,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:01,496 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:01,497 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:01,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -763481844, now seen corresponding path program 1 times [2018-11-23 11:08:01,497 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:01,498 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:08:01,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:08:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:01,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:01,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 11:08:01,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {866#true} is VALID [2018-11-23 11:08:01,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:08:01,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #57#return; {866#true} is VALID [2018-11-23 11:08:01,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret13 := main(); {866#true} is VALID [2018-11-23 11:08:01,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {886#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:01,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {886#(= main_~j~0 (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {886#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:01,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {886#(= main_~j~0 (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {893#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {893#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {893#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,767 INFO L273 TraceCheckUtils]: 9: Hoare triple {893#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {900#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {900#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {900#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {907#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {907#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {907#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {907#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {914#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:01,770 INFO L273 TraceCheckUtils]: 14: Hoare triple {914#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {867#false} is VALID [2018-11-23 11:08:01,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {867#false} is VALID [2018-11-23 11:08:01,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {867#false} is VALID [2018-11-23 11:08:01,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {867#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {867#false} is VALID [2018-11-23 11:08:01,772 INFO L273 TraceCheckUtils]: 18: Hoare triple {867#false} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {867#false} is VALID [2018-11-23 11:08:01,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {867#false} is VALID [2018-11-23 11:08:01,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {867#false} is VALID [2018-11-23 11:08:01,773 INFO L256 TraceCheckUtils]: 21: Hoare triple {867#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {867#false} is VALID [2018-11-23 11:08:01,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {867#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {867#false} is VALID [2018-11-23 11:08:01,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {867#false} assume true; {867#false} is VALID [2018-11-23 11:08:01,775 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {867#false} {867#false} #61#return; {867#false} is VALID [2018-11-23 11:08:01,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {867#false} is VALID [2018-11-23 11:08:01,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 11:08:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:08:01,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:02,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#false} assume !false; {867#false} is VALID [2018-11-23 11:08:02,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#false} assume 0bv32 == #t~ret12;havoc #t~ret12; {867#false} is VALID [2018-11-23 11:08:02,073 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {866#true} {867#false} #61#return; {867#false} is VALID [2018-11-23 11:08:02,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:08:02,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {866#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {866#true} is VALID [2018-11-23 11:08:02,075 INFO L256 TraceCheckUtils]: 21: Hoare triple {867#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {866#true} is VALID [2018-11-23 11:08:02,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {867#false} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {867#false} is VALID [2018-11-23 11:08:02,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {867#false} is VALID [2018-11-23 11:08:02,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {867#false} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {867#false} is VALID [2018-11-23 11:08:02,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {867#false} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {867#false} is VALID [2018-11-23 11:08:02,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {867#false} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {867#false} is VALID [2018-11-23 11:08:02,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {867#false} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {867#false} is VALID [2018-11-23 11:08:02,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {990#(bvslt main_~j~0 (_ bv10 32))} assume !~bvslt32(~j~0, 10bv32); {867#false} is VALID [2018-11-23 11:08:02,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {994#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {990#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-23 11:08:02,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {994#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {994#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {1001#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {994#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {1001#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1001#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {1008#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1001#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {1008#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1008#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {1015#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1008#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {1015#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1015#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {866#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1015#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:02,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret13 := main(); {866#true} is VALID [2018-11-23 11:08:02,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #57#return; {866#true} is VALID [2018-11-23 11:08:02,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2018-11-23 11:08:02,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {866#true} is VALID [2018-11-23 11:08:02,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2018-11-23 11:08:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:08:02,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:02,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:08:02,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:08:02,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:02,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:08:02,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:02,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:08:02,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:08:02,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:08:02,217 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2018-11-23 11:08:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:04,456 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 11:08:04,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:08:04,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:08:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:08:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-23 11:08:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:08:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-23 11:08:04,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2018-11-23 11:08:04,586 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-23 11:08:04,588 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:08:04,588 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:08:04,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:08:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:08:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:08:04,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:04,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:04,658 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:04,661 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:08:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:08:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:04,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:04,662 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:04,662 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:04,665 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:08:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:08:04,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:04,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:04,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:04,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:08:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 11:08:04,669 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 27 [2018-11-23 11:08:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:04,669 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 11:08:04,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:08:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:08:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:08:04,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:04,671 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:04,671 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:04,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash -551618496, now seen corresponding path program 2 times [2018-11-23 11:08:04,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:04,673 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:08:04,703 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:08:04,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:08:04,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:08:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:05,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:05,881 INFO L478 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 15 treesize of output 12 [2018-11-23 11:08:05,902 INFO L478 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 12 treesize of output 11 [2018-11-23 11:08:05,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:05,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,013 INFO L478 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 11 treesize of output 8 [2018-11-23 11:08:06,022 INFO L478 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 8 treesize of output 7 [2018-11-23 11:08:06,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:37 [2018-11-23 11:08:06,235 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:06,235 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_18|, |main_~#array~0.offset|, main_~i~0, |v_#memory_$Pointer$.base_18|, |main_~#array~0.base|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (and (= .cse0 main_~pa~0.offset) (= .cse1 main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (select (select |#memory_int| .cse1) .cse0) |main_#t~mem8|) (= (store |v_#memory_$Pointer$.offset_18| |main_~#cont~0.base| (store (select |v_#memory_$Pointer$.offset_18| |main_~#cont~0.base|) |main_~#cont~0.offset| (bvadd |main_~#array~0.offset| (bvmul (_ bv8 32) main_~i~0)))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_18| |main_~#cont~0.base| (store (select |v_#memory_$Pointer$.base_18| |main_~#cont~0.base|) |main_~#cont~0.offset| |main_~#array~0.base|))))) [2018-11-23 11:08:06,235 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (and (= .cse0 main_~pa~0.offset) (= .cse1 main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (select (select |#memory_int| .cse1) .cse0) |main_#t~mem8|))) [2018-11-23 11:08:09,976 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:08:10,610 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:08:10,765 INFO L256 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2018-11-23 11:08:10,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {1265#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1265#true} is VALID [2018-11-23 11:08:10,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {1265#true} assume true; {1265#true} is VALID [2018-11-23 11:08:10,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1265#true} {1265#true} #57#return; {1265#true} is VALID [2018-11-23 11:08:10,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {1265#true} call #t~ret13 := main(); {1265#true} is VALID [2018-11-23 11:08:10,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {1265#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,773 INFO L273 TraceCheckUtils]: 14: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,776 INFO L273 TraceCheckUtils]: 18: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,776 INFO L273 TraceCheckUtils]: 19: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,777 INFO L273 TraceCheckUtils]: 20: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:10,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {1285#(= |main_~#cont~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:08:11,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {1285#(= |main_~#cont~0.offset| (_ bv0 32))} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {1352#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) |main_#t~mem8|))} is VALID [2018-11-23 11:08:11,046 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) |main_#t~mem8|))} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {1356#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:08:11,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {1356#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1360#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:08:11,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {1360#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {1364#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:08:11,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {1364#(and (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)) main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1368#(and (= |main_#t~mem10| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:08:11,111 INFO L273 TraceCheckUtils]: 32: Hoare triple {1368#(and (= |main_#t~mem10| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {1372#(and (not (bvslt main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:08:13,127 INFO L256 TraceCheckUtils]: 33: Hoare triple {1372#(and (not (bvslt main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1376#(exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))))} is UNKNOWN [2018-11-23 11:08:13,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {1376#(exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))))} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1380#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:13,729 INFO L273 TraceCheckUtils]: 35: Hoare triple {1380#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1384#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (bvslt v_prenex_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_2) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_prenex_2) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_prenex_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_2) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_prenex_2) (_ bv0 32)) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_2) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_prenex_2) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:15,018 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1384#(or (and (exists ((v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (|v_main_~#cont~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |v_main_~#cont~0.base_BEFORE_CALL_1|) (_ bv0 32)) (_ bv4 32)))))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)) (= |check_#res| (_ bv0 32))) (and (exists ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (not (bvslt v_prenex_1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_2) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_prenex_2) (_ bv0 32)) (_ bv4 32))))) (bvslt (bvadd v_prenex_1 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_2) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_prenex_2) (_ bv0 32)) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_2) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_prenex_2) (_ bv0 32)) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} {1372#(and (not (bvslt main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))))) (= |main_~#cont~0.offset| (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv0 32)))} #61#return; {1388#(= (_ bv1 32) |main_#t~ret12|)} is VALID [2018-11-23 11:08:15,019 INFO L273 TraceCheckUtils]: 37: Hoare triple {1388#(= (_ bv1 32) |main_#t~ret12|)} assume 0bv32 == #t~ret12;havoc #t~ret12; {1266#false} is VALID [2018-11-23 11:08:15,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2018-11-23 11:08:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 11:08:15,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:19,402 INFO L273 TraceCheckUtils]: 38: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2018-11-23 11:08:19,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {1398#(not (= |main_#t~ret12| (_ bv0 32)))} assume 0bv32 == #t~ret12;havoc #t~ret12; {1266#false} is VALID [2018-11-23 11:08:19,408 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1406#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} {1402#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0)} #61#return; {1398#(not (= |main_#t~ret12| (_ bv0 32)))} is VALID [2018-11-23 11:08:19,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {1406#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} assume true; {1406#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} is VALID [2018-11-23 11:08:19,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {1265#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1 := read~intINTTYPE4(#t~mem0.base, ~bvadd32(4bv32, #t~mem0.offset), 4bv32);#res := (if #t~mem1 == ~i then 1bv32 else 0bv32);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1406#(or (not (= |check_#res| (_ bv0 32))) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) (_ bv4 32))) |check_#in~i|)))} is VALID [2018-11-23 11:08:19,411 INFO L256 TraceCheckUtils]: 33: Hoare triple {1402#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0)} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1265#true} is VALID [2018-11-23 11:08:19,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {1416#(or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0) (bvslt main_~i~0 |main_#t~mem10|))} assume !~bvslt32(~i~0, #t~mem10);havoc #t~mem10; {1402#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0)} is VALID [2018-11-23 11:08:19,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {1420#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1416#(or (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0) (bvslt main_~i~0 |main_#t~mem10|))} is VALID [2018-11-23 11:08:19,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {1424#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem10|)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} assume !!~bvslt32(~i~0, #t~mem10);havoc #t~mem10;#t~pre11 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre11; {1420#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) main_~i~0))} is VALID [2018-11-23 11:08:19,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {1428#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} call #t~mem10 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1424#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem10|)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} is VALID [2018-11-23 11:08:19,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {1432#(or (not (bvsgt |main_#t~mem8| (_ bv0 32))) (forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0))))} assume ~bvsgt32(#t~mem8, 0bv32);havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8;call #t~mem9 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);~i~0 := ~bvsub32(#t~mem9, 10bv32);havoc #t~mem9; {1428#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)))} is VALID [2018-11-23 11:08:19,443 INFO L273 TraceCheckUtils]: 27: Hoare triple {1265#true} assume ~bvsge32(~i~0, 0bv32) && ~bvslt32(~i~0, 10bv32);call write~$Pointer$(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~i~0)), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem6.base, ~bvadd32(4bv32, #t~mem6.offset);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, ~bvadd32(4bv32, #t~mem7.offset), 4bv32); {1432#(or (not (bvsgt |main_#t~mem8| (_ bv0 32))) (forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0))))} is VALID [2018-11-23 11:08:19,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {1265#true} assume !~bvslt32(~j~0, 10bv32); {1265#true} is VALID [2018-11-23 11:08:19,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,446 INFO L273 TraceCheckUtils]: 15: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,447 INFO L273 TraceCheckUtils]: 12: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {1265#true} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1265#true} is VALID [2018-11-23 11:08:19,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {1265#true} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet4, ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0)), 4bv32);havoc #t~nondet4;call write~intINTTYPE4(#t~nondet5, ~#array~0.base, ~bvadd32(4bv32, ~bvadd32(~#array~0.offset, ~bvmul32(8bv32, ~j~0))), 4bv32);havoc #t~nondet5; {1265#true} is VALID [2018-11-23 11:08:19,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {1265#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {1265#true} is VALID [2018-11-23 11:08:19,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {1265#true} call #t~ret13 := main(); {1265#true} is VALID [2018-11-23 11:08:19,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1265#true} {1265#true} #57#return; {1265#true} is VALID [2018-11-23 11:08:19,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {1265#true} assume true; {1265#true} is VALID [2018-11-23 11:08:19,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {1265#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1265#true} is VALID [2018-11-23 11:08:19,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2018-11-23 11:08:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:08:19,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:19,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-11-23 11:08:19,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-11-23 11:08:19,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:19,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:08:22,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:22,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:08:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:08:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=343, Unknown=3, NotChecked=0, Total=420 [2018-11-23 11:08:22,957 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2018-11-23 11:08:40,715 WARN L180 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-23 11:08:47,445 WARN L180 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-11-23 11:09:02,412 WARN L180 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-23 11:09:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:02,419 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:09:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:09:02,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-11-23 11:09:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:09:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2018-11-23 11:09:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:09:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2018-11-23 11:09:02,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 22 transitions. [2018-11-23 11:09:06,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:06,840 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:09:06,841 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:09:06,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=114, Invalid=435, Unknown=3, NotChecked=0, Total=552 [2018-11-23 11:09:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:09:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:09:06,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:06,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:06,842 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:06,842 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:06,842 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:09:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:09:06,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:06,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:06,843 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:06,843 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:06,843 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:09:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:09:06,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:06,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:06,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:06,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:09:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:09:06,844 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-23 11:09:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:06,844 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:09:06,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:09:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:09:06,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:06,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:09:07,487 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2018-11-23 11:09:10,190 WARN L180 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 1 [2018-11-23 11:09:10,194 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:09:10,194 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:09:10,195 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:09:10,195 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:09:10,195 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:09:10,195 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:09:10,195 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:09:10,195 INFO L444 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (let ((.cse2 (select (select |#memory_int| .cse1) .cse0))) (and (= .cse0 main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= .cse1 main_~pa~0.base) (not (bvslt main_~i~0 .cse2)) (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|) (bvsgt .cse2 (_ bv0 32))))) [2018-11-23 11:09:10,195 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L444 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (and (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|)) [2018-11-23 11:09:10,196 INFO L448 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2018-11-23 11:09:10,196 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2018-11-23 11:09:10,196 INFO L444 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2018-11-23 11:09:10,197 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2018-11-23 11:09:10,197 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2018-11-23 11:09:10,197 INFO L444 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4 32)))) (and (= .cse0 main_~pa~0.offset) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= .cse1 main_~pa~0.base) (= |main_~#cont~0.offset| (_ bv0 32)) (= (_ bv0 32) |main_~#array~0.offset|) (bvsgt (select (select |#memory_int| .cse1) .cse0) (_ bv0 32)))) [2018-11-23 11:09:10,197 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2018-11-23 11:09:10,197 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2018-11-23 11:09:10,197 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2018-11-23 11:09:10,199 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:09:10,215 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 11:09:10,215 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:09:10,215 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:09:10,215 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 11:09:10,216 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 11:09:10,217 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 11:09:10,217 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 11:09:10,217 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:09:10,217 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:09:10,231 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 11:09:10,231 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:09:10,231 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:09:10,231 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:09:10,232 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:09:10,232 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 11:09:10,232 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 11:09:10,232 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:09:10,232 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:09:10,238 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,239 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,240 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,240 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,243 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,244 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,244 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,244 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,244 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,245 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,251 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,251 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,252 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,253 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,253 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,253 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,253 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,253 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,254 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:09:10 BoogieIcfgContainer [2018-11-23 11:09:10,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:09:10,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:09:10,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:09:10,269 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:09:10,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:55" (3/4) ... [2018-11-23 11:09:10,282 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:09:10,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:09:10,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:09:10,300 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-11-23 11:09:10,307 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-23 11:09:10,307 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:09:10,307 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:09:10,380 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test25_true-unreach-call.c-witness.graphml [2018-11-23 11:09:10,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:09:10,381 INFO L168 Benchmark]: Toolchain (without parser) took 76576.75 ms. Allocated memory was 1.6 GB in the beginning and 2.4 GB in the end (delta: 860.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -688.6 MB). Peak memory consumption was 172.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:09:10,384 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:09:10,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:09:10,385 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.01 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:09:10,385 INFO L168 Benchmark]: Boogie Preprocessor took 131.44 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:09:10,385 INFO L168 Benchmark]: RCFGBuilder took 760.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:09:10,386 INFO L168 Benchmark]: TraceAbstraction took 75107.12 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 116.4 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.6 MB). Peak memory consumption was 182.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:09:10,389 INFO L168 Benchmark]: Witness Printer took 111.79 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:09:10,395 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 432.32 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.01 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.44 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75107.12 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 116.4 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.6 MB). Peak memory consumption was 182.0 MB. Max. memory is 7.1 GB. * Witness Printer took 111.79 ms. Allocated memory is still 2.4 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2018-11-23 11:09:10,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,407 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,407 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,407 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,407 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,407 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,408 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 11:09:10,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 11:09:10,410 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,410 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,410 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,410 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:09:10,410 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 11:09:10,411 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((~bvadd64(#memory_$Pointer$[cont][cont], 4bv32) == pa && ~bvslt32(~bvadd64(i, 4294967295bv32), unknown-#memory_int-unknown[pa][pa])) && #memory_$Pointer$[cont][cont] == pa) && cont == 0bv32) && 0bv32 == array) && ~bvsgt32(unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][~bvadd64(#memory_$Pointer$[cont][cont], 4bv32)], 0bv32) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0bv32 && 0bv32 == array - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 74.9s OverallTime, 6 OverallIterations, 10 TraceHistogramMax, 49.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 32 SDslu, 289 SDs, 0 SdLazy, 215 SolverSat, 36 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 27 NumberOfFragments, 129 HoareAnnotationTreeSize, 14 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 193 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 143 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 219 ConstructedInterpolants, 7 QuantifiedInterpolants, 46035 SizeOfPredicates, 36 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 221/258 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...