java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:57:39,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:57:39,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:57:39,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:57:39,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:57:39,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:57:39,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:57:39,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:57:39,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:57:39,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:57:39,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:57:39,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:57:39,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:57:39,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:57:39,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:57:39,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:57:39,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:57:39,932 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:57:39,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:57:39,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:57:39,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:57:39,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:57:39,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:57:39,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:57:39,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:57:39,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:57:39,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:57:39,950 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:57:39,951 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:57:39,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:57:39,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:57:39,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:57:39,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:57:39,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:57:39,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:57:39,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:57:39,960 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:57:39,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:57:39,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:57:39,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:57:39,987 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:57:39,988 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:57:39,988 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:57:39,988 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:57:39,988 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:57:39,988 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:57:39,989 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:57:39,989 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:57:39,989 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:57:39,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:57:39,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:57:39,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:57:39,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:57:39,990 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:57:39,990 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:57:39,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:57:39,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:57:39,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:57:39,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:57:39,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:57:39,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:57:39,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:57:39,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:57:39,992 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:57:39,992 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:57:39,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:57:39,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:57:39,994 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:57:40,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:57:40,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:57:40,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:57:40,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:57:40,062 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:57:40,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-11-18 23:57:40,121 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f4ea0d7/30ead82ba5bf45ee9471fe8815143ca0/FLAG35e4cba42 [2018-11-18 23:57:40,581 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:57:40,582 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array_true-unreach-call_true-termination.i [2018-11-18 23:57:40,588 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f4ea0d7/30ead82ba5bf45ee9471fe8815143ca0/FLAG35e4cba42 [2018-11-18 23:57:40,955 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3f4ea0d7/30ead82ba5bf45ee9471fe8815143ca0 [2018-11-18 23:57:40,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:57:40,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:57:40,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:40,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:57:40,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:57:40,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:40" (1/1) ... [2018-11-18 23:57:40,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea89150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:40, skipping insertion in model container [2018-11-18 23:57:40,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:40" (1/1) ... [2018-11-18 23:57:40,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:57:41,011 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:57:41,226 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:41,231 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:57:41,255 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:41,275 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:57:41,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41 WrapperNode [2018-11-18 23:57:41,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:41,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:57:41,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:57:41,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:57:41,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (1/1) ... [2018-11-18 23:57:41,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:57:41,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:57:41,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:57:41,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:57:41,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (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-18 23:57:41,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:57:41,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:57:41,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:57:41,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:57:41,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:57:41,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:57:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:57:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:57:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:57:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:57:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:57:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:57:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:57:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:57:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:57:42,004 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:57:42,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:42 BoogieIcfgContainer [2018-11-18 23:57:42,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:57:42,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:57:42,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:57:42,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:57:42,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:57:40" (1/3) ... [2018-11-18 23:57:42,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265d53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:42, skipping insertion in model container [2018-11-18 23:57:42,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:41" (2/3) ... [2018-11-18 23:57:42,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265d53c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:42, skipping insertion in model container [2018-11-18 23:57:42,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:42" (3/3) ... [2018-11-18 23:57:42,014 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call_true-termination.i [2018-11-18 23:57:42,023 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:57:42,031 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:57:42,045 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:57:42,076 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:57:42,077 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:57:42,077 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:57:42,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:57:42,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:57:42,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:57:42,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:57:42,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:57:42,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:57:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 23:57:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 23:57:42,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:42,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:42,108 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:42,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 296275345, now seen corresponding path program 1 times [2018-11-18 23:57:42,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:42,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:42,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:42,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:42,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:42,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-18 23:57:42,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26#true} is VALID [2018-11-18 23:57:42,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-18 23:57:42,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #41#return; {26#true} is VALID [2018-11-18 23:57:42,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2018-11-18 23:57:42,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {26#true} is VALID [2018-11-18 23:57:42,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-18 23:57:42,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {27#false} is VALID [2018-11-18 23:57:42,325 INFO L256 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if #t~mem5 >= ~menor~0 then 1 else 0)); {27#false} is VALID [2018-11-18 23:57:42,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-18 23:57:42,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2018-11-18 23:57:42,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-18 23:57:42,330 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-18 23:57:42,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:42,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:57:42,339 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 23:57:42,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:42,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:57:42,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:42,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:57:42,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:57:42,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:57:42,423 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-18 23:57:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:42,618 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 23:57:42,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:57:42,618 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 23:57:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2018-11-18 23:57:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 40 transitions. [2018-11-18 23:57:42,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 40 transitions. [2018-11-18 23:57:42,944 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-18 23:57:42,954 INFO L225 Difference]: With dead ends: 36 [2018-11-18 23:57:42,954 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 23:57:42,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-18 23:57:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 23:57:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 23:57:43,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:43,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-18 23:57:43,029 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-18 23:57:43,030 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-18 23:57:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:43,035 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-18 23:57:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 23:57:43,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:43,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:43,037 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-18 23:57:43,037 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-18 23:57:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:43,040 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-18 23:57:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 23:57:43,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:43,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:43,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:43,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:57:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 23:57:43,045 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-18 23:57:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:43,046 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 23:57:43,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:57:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 23:57:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 23:57:43,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:43,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:43,047 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:43,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash 665169549, now seen corresponding path program 1 times [2018-11-18 23:57:43,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:43,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:43,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:43,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:43,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:43,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-18 23:57:43,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {130#true} is VALID [2018-11-18 23:57:43,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-18 23:57:43,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {130#true} {130#true} #41#return; {130#true} is VALID [2018-11-18 23:57:43,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {130#true} call #t~ret6 := main(); {130#true} is VALID [2018-11-18 23:57:43,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {130#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {132#(and (<= 1 main_~SIZE~0) (= main_~j~0 0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID [2018-11-18 23:57:43,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#(and (<= 1 main_~SIZE~0) (= main_~j~0 0) (<= (div main_~SIZE~0 4294967296) 0))} assume true; {132#(and (<= 1 main_~SIZE~0) (= main_~j~0 0) (<= (div main_~SIZE~0 4294967296) 0))} is VALID [2018-11-18 23:57:43,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {132#(and (<= 1 main_~SIZE~0) (= main_~j~0 0) (<= (div main_~SIZE~0 4294967296) 0))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {131#false} is VALID [2018-11-18 23:57:43,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {131#false} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {131#false} is VALID [2018-11-18 23:57:43,244 INFO L256 TraceCheckUtils]: 9: Hoare triple {131#false} call __VERIFIER_assert((if #t~mem5 >= ~menor~0 then 1 else 0)); {131#false} is VALID [2018-11-18 23:57:43,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {131#false} ~cond := #in~cond; {131#false} is VALID [2018-11-18 23:57:43,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {131#false} assume 0 == ~cond; {131#false} is VALID [2018-11-18 23:57:43,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-18 23:57:43,246 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-18 23:57:43,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:43,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:57:43,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 23:57:43,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:43,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:57:43,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:43,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:57:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:57:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:57:43,305 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-18 23:57:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:43,517 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-18 23:57:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:57:43,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 23:57:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:57:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-18 23:57:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:57:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-18 23:57:43,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2018-11-18 23:57:43,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:43,585 INFO L225 Difference]: With dead ends: 26 [2018-11-18 23:57:43,585 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 23:57:43,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 23:57:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 23:57:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-11-18 23:57:43,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:43,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 18 states. [2018-11-18 23:57:43,680 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 18 states. [2018-11-18 23:57:43,681 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 18 states. [2018-11-18 23:57:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:43,684 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-18 23:57:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-18 23:57:43,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:43,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:43,684 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 20 states. [2018-11-18 23:57:43,685 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 20 states. [2018-11-18 23:57:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:43,687 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-18 23:57:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-18 23:57:43,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:43,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:43,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:43,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:57:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 23:57:43,690 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-18 23:57:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:43,690 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 23:57:43,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:57:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-18 23:57:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:57:43,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:43,692 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:43,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:43,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash 361632356, now seen corresponding path program 1 times [2018-11-18 23:57:43,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:45,024 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 20 [2018-11-18 23:57:45,471 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 36 [2018-11-18 23:57:46,164 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 36 [2018-11-18 23:57:46,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-18 23:57:46,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {237#true} is VALID [2018-11-18 23:57:46,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-18 23:57:46,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #41#return; {237#true} is VALID [2018-11-18 23:57:46,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret6 := main(); {237#true} is VALID [2018-11-18 23:57:46,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {239#(and (= |main_~#array~0.offset| 0) (or (<= 1 main_~SIZE~0) (<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647))) (<= main_~SIZE~0 1) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-18 23:57:46,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(and (= |main_~#array~0.offset| 0) (or (<= 1 main_~SIZE~0) (<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647))) (<= main_~SIZE~0 1) (<= 0 (div main_~SIZE~0 4294967296)))} assume true; {239#(and (= |main_~#array~0.offset| 0) (or (<= 1 main_~SIZE~0) (<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647))) (<= main_~SIZE~0 1) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-18 23:57:46,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (= |main_~#array~0.offset| 0) (or (<= 1 main_~SIZE~0) (<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647))) (<= main_~SIZE~0 1) (<= 0 (div main_~SIZE~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {240#(and (= (* 17179869184 (div main_~j~0 4294967296)) (* 4 main_~j~0)) (= |main_#t~mem3| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* 4 main_~j~0) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} is VALID [2018-11-18 23:57:46,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {240#(and (= (* 17179869184 (div main_~j~0 4294967296)) (* 4 main_~j~0)) (= |main_#t~mem3| (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* 4 main_~j~0) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* 4294967296 (div main_~SIZE~0 4294967296)) 1)))} assume #t~mem3 <= ~menor~0;havoc #t~mem3;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem4;havoc #t~mem4; {241#(and (= (* 17179869184 (div main_~j~0 4294967296)) (* 4 main_~j~0)) (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* 4 main_~j~0) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* 4294967296 (div main_~SIZE~0 4294967296)) 1)) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-18 23:57:46,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {241#(and (= (* 17179869184 (div main_~j~0 4294967296)) (* 4 main_~j~0)) (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* 4 main_~j~0) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 main_~j~0) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* 4294967296 (div main_~SIZE~0 4294967296)) 1)) (<= 0 (div main_~SIZE~0 4294967296)))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {242#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-18 23:57:46,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {242#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} assume true; {242#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} is VALID [2018-11-18 23:57:46,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {242#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (div main_~SIZE~0 4294967296) 0) (<= 0 (div main_~SIZE~0 4294967296)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2018-11-18 23:57:46,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {244#(<= main_~menor~0 |main_#t~mem5|)} is VALID [2018-11-18 23:57:46,417 INFO L256 TraceCheckUtils]: 13: Hoare triple {244#(<= main_~menor~0 |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 >= ~menor~0 then 1 else 0)); {245#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:46,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {245#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {246#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:46,418 INFO L273 TraceCheckUtils]: 15: Hoare triple {246#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {238#false} is VALID [2018-11-18 23:57:46,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-18 23:57:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:46,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:57:46,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:57:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:46,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:57:46,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-11-18 23:57:46,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-18 23:57:46,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:46,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:46,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:46,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-11-18 23:57:46,885 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:47,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 23:57:47,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 23:57:47,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:57:47,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:57:47,177 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-18 23:57:47,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-18 23:57:47,189 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:57:47,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-18 23:57:47,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {237#true} is VALID [2018-11-18 23:57:47,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-18 23:57:47,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #41#return; {237#true} is VALID [2018-11-18 23:57:47,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret6 := main(); {237#true} is VALID [2018-11-18 23:57:47,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {265#(and (= main_~SIZE~0 1) (= main_~j~0 0))} is VALID [2018-11-18 23:57:47,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {265#(and (= main_~SIZE~0 1) (= main_~j~0 0))} assume true; {265#(and (= main_~SIZE~0 1) (= main_~j~0 0))} is VALID [2018-11-18 23:57:47,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#(and (= main_~SIZE~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); {265#(and (= main_~SIZE~0 1) (= main_~j~0 0))} is VALID [2018-11-18 23:57:47,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {265#(and (= main_~SIZE~0 1) (= main_~j~0 0))} assume #t~mem3 <= ~menor~0;havoc #t~mem3;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem4;havoc #t~mem4; {275#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~j~0 4294967296)) |main_~#array~0.offset|))) (= main_~j~0 0))} is VALID [2018-11-18 23:57:47,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {275#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* 4 (mod main_~j~0 4294967296)) |main_~#array~0.offset|))) (= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {279#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1))} is VALID [2018-11-18 23:57:47,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {279#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1))} assume true; {279#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1))} is VALID [2018-11-18 23:57:47,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#(and (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2018-11-18 23:57:47,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {243#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); {244#(<= main_~menor~0 |main_#t~mem5|)} is VALID [2018-11-18 23:57:47,243 INFO L256 TraceCheckUtils]: 13: Hoare triple {244#(<= main_~menor~0 |main_#t~mem5|)} call __VERIFIER_assert((if #t~mem5 >= ~menor~0 then 1 else 0)); {245#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:57:47,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {245#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {246#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:57:47,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {246#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {238#false} is VALID [2018-11-18 23:57:47,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-18 23:57:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:57:47,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:57:47,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-11-18 23:57:47,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-11-18 23:57:47,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:47,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:57:47,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:47,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:57:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:57:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:57:47,376 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 13 states. [2018-11-18 23:57:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:48,124 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-11-18 23:57:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:57:48,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2018-11-18 23:57:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:57:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-11-18 23:57:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:57:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2018-11-18 23:57:48,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2018-11-18 23:57:48,176 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-18 23:57:48,176 INFO L225 Difference]: With dead ends: 26 [2018-11-18 23:57:48,176 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:57:48,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-11-18 23:57:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:57:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:57:48,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:48,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:48,179 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:48,179 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:48,179 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:57:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:57:48,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:48,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:48,180 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:48,180 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:57:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:48,180 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:57:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:57:48,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:48,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:48,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:48,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:57:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:57:48,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-18 23:57:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:48,182 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:57:48,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:57:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:57:48,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:48,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:57:48,308 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:57:48,308 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:57:48,308 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:57:48,309 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:57:48,309 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:57:48,309 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:57:48,309 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:57:48,309 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 29) the Hoare annotation is: true [2018-11-18 23:57:48,309 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (= main_~SIZE~0 1) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= main_~menor~0 |main_#t~mem5|) (= main_~j~0 1)) [2018-11-18 23:57:48,309 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-18 23:57:48,310 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 29) no Hoare annotation was computed. [2018-11-18 23:57:48,310 INFO L425 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2018-11-18 23:57:48,310 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-11-18 23:57:48,310 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-11-18 23:57:48,310 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 24) the Hoare annotation is: (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= main_~SIZE~0 1))) (or (and .cse0 .cse1 (= main_~j~0 0)) (and .cse0 .cse1 (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~j~0 1)))) [2018-11-18 23:57:48,310 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 24) no Hoare annotation was computed. [2018-11-18 23:57:48,310 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 29) no Hoare annotation was computed. [2018-11-18 23:57:48,311 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 23:57:48,311 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:57:48,311 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 23:57:48,311 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 23:57:48,311 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 23:57:48,311 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 23:57:48,313 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:57:48,314 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:57:48,314 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: L19-5 has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:57:48,315 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L19-5 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-18 23:57:48,316 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-18 23:57:48,317 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:57:48,317 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 23:57:48,317 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2018-11-18 23:57:48,317 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2018-11-18 23:57:48,317 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:57:48,317 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:57:48,317 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:57:48,324 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:57:48,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:57:48,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:57:48 BoogieIcfgContainer [2018-11-18 23:57:48,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:57:48,331 INFO L168 Benchmark]: Toolchain (without parser) took 7365.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -381.5 MB). Peak memory consumption was 333.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:48,332 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:57:48,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.15 ms. Allocated memory is still 1.5 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-18 23:57:48,334 INFO L168 Benchmark]: Boogie Preprocessor took 43.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:57:48,335 INFO L168 Benchmark]: RCFGBuilder took 685.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -752.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:48,336 INFO L168 Benchmark]: TraceAbstraction took 6323.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 360.1 MB). Peak memory consumption was 360.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:48,340 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.15 ms. Allocated memory is still 1.5 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 Preprocessor took 43.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 685.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -752.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6323.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 360.1 MB). Peak memory consumption was 360.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 19]: Loop Invariant [2018-11-18 23:57:48,348 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:57:48,349 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((array == 0 && SIZE == 1) && j == 0) || (((array == 0 && SIZE == 1) && menor <= unknown-#memory_int-unknown[array][array]) && j == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 6.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 12 SDslu, 77 SDs, 0 SdLazy, 66 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 13 NumberOfFragments, 53 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 5729 SizeOfPredicates, 7 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...