/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/condgf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:12,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:12,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:12,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:12,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:12,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:12,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:12,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:12,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:12,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:12,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:12,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:12,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:12,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:12,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:12,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:12,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:12,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:12,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:12,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:12,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:12,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:12,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:12,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:12,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:12,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:12,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:12,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:12,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:12,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:12,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:12,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:12,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:12,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:12,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:12,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:12,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:12,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:12,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:12,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:12,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:12,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:12,562 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:12,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:12,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:12,564 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:12,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:12,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:12,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:12,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:12,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:12,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:12,566 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:12,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:12,566 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:12,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:12,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:12,567 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:12,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:12,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:12,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:12,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:12,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:12,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:12,568 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:12,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:12,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:12,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:12,886 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:12,886 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:12,887 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condgf.c [2020-07-18 00:47:12,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5973a6c8a/f2392625d50d42a78a5075a109a12204/FLAG49f7fd722 [2020-07-18 00:47:13,480 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:13,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condgf.c [2020-07-18 00:47:13,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5973a6c8a/f2392625d50d42a78a5075a109a12204/FLAG49f7fd722 [2020-07-18 00:47:13,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5973a6c8a/f2392625d50d42a78a5075a109a12204 [2020-07-18 00:47:13,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:13,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:13,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:13,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:13,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:13,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6704c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:13, skipping insertion in model container [2020-07-18 00:47:13,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:13" (1/1) ... [2020-07-18 00:47:13,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:13,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:14,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:14,138 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:14,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:14,180 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:14,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14 WrapperNode [2020-07-18 00:47:14,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:14,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:14,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:14,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:14,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (1/1) ... [2020-07-18 00:47:14,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:14,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:14,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:14,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:14,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (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 [2020-07-18 00:47:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:47:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:14,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:47:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:47:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:47:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:47:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:47:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:14,837 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:14,837 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:47:14,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:14 BoogieIcfgContainer [2020-07-18 00:47:14,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:14,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:14,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:14,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:14,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:13" (1/3) ... [2020-07-18 00:47:14,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669a81e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:14, skipping insertion in model container [2020-07-18 00:47:14,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:14" (2/3) ... [2020-07-18 00:47:14,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669a81e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:14, skipping insertion in model container [2020-07-18 00:47:14,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:14" (3/3) ... [2020-07-18 00:47:14,851 INFO L109 eAbstractionObserver]: Analyzing ICFG condgf.c [2020-07-18 00:47:14,862 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:14,871 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:14,886 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:14,912 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:14,912 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:14,912 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:14,912 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:14,913 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:14,913 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:14,913 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:14,914 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-07-18 00:47:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:14,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:14,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:14,951 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:14,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1924334027, now seen corresponding path program 1 times [2020-07-18 00:47:14,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:14,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [403207013] [2020-07-18 00:47:14,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:15,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-18 00:47:15,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-18 00:47:15,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-18 00:47:15,222 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-18 00:47:15,222 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 00:47:15,223 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID [2020-07-18 00:47:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:15,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-18 00:47:15,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-18 00:47:15,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 00:47:15,234 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-18 00:47:15,236 INFO L263 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:15,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-18 00:47:15,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-18 00:47:15,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-18 00:47:15,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-18 00:47:15,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 00:47:15,239 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID [2020-07-18 00:47:15,239 INFO L263 TraceCheckUtils]: 7: Hoare triple {79#true} call #t~ret12 := main(); {79#true} is VALID [2020-07-18 00:47:15,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {79#true} is VALID [2020-07-18 00:47:15,240 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} ~N~0 := #t~nondet0; {79#true} is VALID [2020-07-18 00:47:15,241 INFO L280 TraceCheckUtils]: 10: Hoare triple {79#true} havoc #t~nondet0; {79#true} is VALID [2020-07-18 00:47:15,241 INFO L280 TraceCheckUtils]: 11: Hoare triple {79#true} assume !(~N~0 <= 0); {79#true} is VALID [2020-07-18 00:47:15,241 INFO L263 TraceCheckUtils]: 12: Hoare triple {79#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {79#true} is VALID [2020-07-18 00:47:15,242 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-18 00:47:15,242 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-18 00:47:15,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-18 00:47:15,243 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-18 00:47:15,243 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#true} havoc ~i~0; {79#true} is VALID [2020-07-18 00:47:15,244 INFO L280 TraceCheckUtils]: 18: Hoare triple {79#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {79#true} is VALID [2020-07-18 00:47:15,244 INFO L280 TraceCheckUtils]: 19: Hoare triple {79#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {79#true} is VALID [2020-07-18 00:47:15,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {79#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {79#true} is VALID [2020-07-18 00:47:15,245 INFO L280 TraceCheckUtils]: 21: Hoare triple {79#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {79#true} is VALID [2020-07-18 00:47:15,246 INFO L280 TraceCheckUtils]: 22: Hoare triple {79#true} ~i~0 := 0; {79#true} is VALID [2020-07-18 00:47:15,247 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#true} assume !true; {80#false} is VALID [2020-07-18 00:47:15,247 INFO L280 TraceCheckUtils]: 24: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-18 00:47:15,248 INFO L280 TraceCheckUtils]: 25: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-18 00:47:15,248 INFO L280 TraceCheckUtils]: 26: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-18 00:47:15,249 INFO L280 TraceCheckUtils]: 27: Hoare triple {80#false} assume !(~i~0 < ~N~0); {80#false} is VALID [2020-07-18 00:47:15,249 INFO L280 TraceCheckUtils]: 28: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-18 00:47:15,250 INFO L280 TraceCheckUtils]: 29: Hoare triple {80#false} assume !!(~i~0 < ~N~0); {80#false} is VALID [2020-07-18 00:47:15,250 INFO L280 TraceCheckUtils]: 30: Hoare triple {80#false} SUMMARY for call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L51 {80#false} is VALID [2020-07-18 00:47:15,250 INFO L263 TraceCheckUtils]: 31: Hoare triple {80#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {80#false} is VALID [2020-07-18 00:47:15,251 INFO L280 TraceCheckUtils]: 32: Hoare triple {80#false} ~cond := #in~cond; {80#false} is VALID [2020-07-18 00:47:15,251 INFO L280 TraceCheckUtils]: 33: Hoare triple {80#false} assume 0 == ~cond; {80#false} is VALID [2020-07-18 00:47:15,252 INFO L280 TraceCheckUtils]: 34: Hoare triple {80#false} assume !false; {80#false} is VALID [2020-07-18 00:47:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:15,260 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:15,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [403207013] [2020-07-18 00:47:15,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:15,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:47:15,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123894297] [2020-07-18 00:47:15,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-18 00:47:15,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:15,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:47:15,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:15,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:47:15,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:15,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:47:15,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:15,361 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-07-18 00:47:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:15,832 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2020-07-18 00:47:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:47:15,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-18 00:47:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 00:47:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:47:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 00:47:15,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-18 00:47:16,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,093 INFO L225 Difference]: With dead ends: 135 [2020-07-18 00:47:16,093 INFO L226 Difference]: Without dead ends: 67 [2020-07-18 00:47:16,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:47:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-18 00:47:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-18 00:47:16,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:16,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-18 00:47:16,198 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-18 00:47:16,199 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-18 00:47:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,205 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-18 00:47:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-18 00:47:16,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:16,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:16,207 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-18 00:47:16,207 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-18 00:47:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:16,213 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-18 00:47:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-18 00:47:16,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:16,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:16,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:16,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-18 00:47:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-07-18 00:47:16,221 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 35 [2020-07-18 00:47:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:16,222 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-07-18 00:47:16,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:47:16,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2020-07-18 00:47:16,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-18 00:47:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:47:16,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:16,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:16,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:16,312 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash -977702175, now seen corresponding path program 1 times [2020-07-18 00:47:16,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:16,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1951599261] [2020-07-18 00:47:16,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:16,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {632#true} is VALID [2020-07-18 00:47:16,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} #valid := #valid[0 := 0]; {632#true} is VALID [2020-07-18 00:47:16,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} assume 0 < #StackHeapBarrier; {632#true} is VALID [2020-07-18 00:47:16,431 INFO L280 TraceCheckUtils]: 3: Hoare triple {632#true} ~N~0 := 0; {632#true} is VALID [2020-07-18 00:47:16,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-18 00:47:16,431 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {632#true} {632#true} #138#return; {632#true} is VALID [2020-07-18 00:47:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:16,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {632#true} ~cond := #in~cond; {632#true} is VALID [2020-07-18 00:47:16,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} assume !(0 == ~cond); {632#true} is VALID [2020-07-18 00:47:16,441 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-18 00:47:16,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {632#true} {640#(<= 1 ~N~0)} #134#return; {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,443 INFO L263 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:47:16,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {632#true} is VALID [2020-07-18 00:47:16,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} #valid := #valid[0 := 0]; {632#true} is VALID [2020-07-18 00:47:16,444 INFO L280 TraceCheckUtils]: 3: Hoare triple {632#true} assume 0 < #StackHeapBarrier; {632#true} is VALID [2020-07-18 00:47:16,444 INFO L280 TraceCheckUtils]: 4: Hoare triple {632#true} ~N~0 := 0; {632#true} is VALID [2020-07-18 00:47:16,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-18 00:47:16,445 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {632#true} {632#true} #138#return; {632#true} is VALID [2020-07-18 00:47:16,445 INFO L263 TraceCheckUtils]: 7: Hoare triple {632#true} call #t~ret12 := main(); {632#true} is VALID [2020-07-18 00:47:16,446 INFO L280 TraceCheckUtils]: 8: Hoare triple {632#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {632#true} is VALID [2020-07-18 00:47:16,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {632#true} ~N~0 := #t~nondet0; {632#true} is VALID [2020-07-18 00:47:16,446 INFO L280 TraceCheckUtils]: 10: Hoare triple {632#true} havoc #t~nondet0; {632#true} is VALID [2020-07-18 00:47:16,447 INFO L280 TraceCheckUtils]: 11: Hoare triple {632#true} assume !(~N~0 <= 0); {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,448 INFO L263 TraceCheckUtils]: 12: Hoare triple {640#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {632#true} is VALID [2020-07-18 00:47:16,448 INFO L280 TraceCheckUtils]: 13: Hoare triple {632#true} ~cond := #in~cond; {632#true} is VALID [2020-07-18 00:47:16,449 INFO L280 TraceCheckUtils]: 14: Hoare triple {632#true} assume !(0 == ~cond); {632#true} is VALID [2020-07-18 00:47:16,449 INFO L280 TraceCheckUtils]: 15: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-18 00:47:16,450 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {632#true} {640#(<= 1 ~N~0)} #134#return; {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,451 INFO L280 TraceCheckUtils]: 17: Hoare triple {640#(<= 1 ~N~0)} havoc ~i~0; {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,452 INFO L280 TraceCheckUtils]: 18: Hoare triple {640#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,453 INFO L280 TraceCheckUtils]: 19: Hoare triple {640#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,454 INFO L280 TraceCheckUtils]: 20: Hoare triple {640#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,455 INFO L280 TraceCheckUtils]: 21: Hoare triple {640#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {640#(<= 1 ~N~0)} is VALID [2020-07-18 00:47:16,456 INFO L280 TraceCheckUtils]: 22: Hoare triple {640#(<= 1 ~N~0)} ~i~0 := 0; {645#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 00:47:16,457 INFO L280 TraceCheckUtils]: 23: Hoare triple {645#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {633#false} is VALID [2020-07-18 00:47:16,457 INFO L280 TraceCheckUtils]: 24: Hoare triple {633#false} ~i~0 := 0; {633#false} is VALID [2020-07-18 00:47:16,457 INFO L280 TraceCheckUtils]: 25: Hoare triple {633#false} assume !(~i~0 < ~N~0); {633#false} is VALID [2020-07-18 00:47:16,458 INFO L280 TraceCheckUtils]: 26: Hoare triple {633#false} ~i~0 := 0; {633#false} is VALID [2020-07-18 00:47:16,458 INFO L280 TraceCheckUtils]: 27: Hoare triple {633#false} assume !(~i~0 < ~N~0); {633#false} is VALID [2020-07-18 00:47:16,458 INFO L280 TraceCheckUtils]: 28: Hoare triple {633#false} ~i~0 := 0; {633#false} is VALID [2020-07-18 00:47:16,459 INFO L280 TraceCheckUtils]: 29: Hoare triple {633#false} assume !!(~i~0 < ~N~0); {633#false} is VALID [2020-07-18 00:47:16,459 INFO L280 TraceCheckUtils]: 30: Hoare triple {633#false} SUMMARY for call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L51 {633#false} is VALID [2020-07-18 00:47:16,459 INFO L263 TraceCheckUtils]: 31: Hoare triple {633#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {633#false} is VALID [2020-07-18 00:47:16,460 INFO L280 TraceCheckUtils]: 32: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2020-07-18 00:47:16,460 INFO L280 TraceCheckUtils]: 33: Hoare triple {633#false} assume 0 == ~cond; {633#false} is VALID [2020-07-18 00:47:16,461 INFO L280 TraceCheckUtils]: 34: Hoare triple {633#false} assume !false; {633#false} is VALID [2020-07-18 00:47:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:16,468 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:16,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1951599261] [2020-07-18 00:47:16,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:16,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:16,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359025792] [2020-07-18 00:47:16,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-18 00:47:16,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:16,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:16,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:16,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:16,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:16,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:16,517 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2020-07-18 00:47:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:17,151 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2020-07-18 00:47:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:47:17,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-18 00:47:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2020-07-18 00:47:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2020-07-18 00:47:17,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 149 transitions. [2020-07-18 00:47:17,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:17,318 INFO L225 Difference]: With dead ends: 137 [2020-07-18 00:47:17,318 INFO L226 Difference]: Without dead ends: 98 [2020-07-18 00:47:17,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-18 00:47:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2020-07-18 00:47:17,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:17,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 70 states. [2020-07-18 00:47:17,442 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 70 states. [2020-07-18 00:47:17,442 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 70 states. [2020-07-18 00:47:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:17,448 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-18 00:47:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2020-07-18 00:47:17,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:17,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:17,450 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 98 states. [2020-07-18 00:47:17,450 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 98 states. [2020-07-18 00:47:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:17,456 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-18 00:47:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2020-07-18 00:47:17,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:17,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:17,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:17,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-18 00:47:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-07-18 00:47:17,461 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 35 [2020-07-18 00:47:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:17,462 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-07-18 00:47:17,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:17,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2020-07-18 00:47:17,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-18 00:47:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 00:47:17,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:17,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:17,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:17,578 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -269448694, now seen corresponding path program 1 times [2020-07-18 00:47:17,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:17,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388506510] [2020-07-18 00:47:17,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:17,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:47:17,621 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:47:17,631 INFO L168 Benchmark]: Toolchain (without parser) took 3736.30 ms. Allocated memory was 142.6 MB in the beginning and 253.8 MB in the end (delta: 111.1 MB). Free memory was 100.0 MB in the beginning and 215.5 MB in the end (delta: -115.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:17,634 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:47:17,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.64 ms. Allocated memory is still 142.6 MB. Free memory was 99.6 MB in the beginning and 88.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:17,639 INFO L168 Benchmark]: Boogie Preprocessor took 135.87 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 88.4 MB in the beginning and 177.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:17,640 INFO L168 Benchmark]: RCFGBuilder took 524.15 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 144.5 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:47:17,642 INFO L168 Benchmark]: TraceAbstraction took 2782.23 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 143.8 MB in the beginning and 215.5 MB in the end (delta: -71.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:47:17,650 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.64 ms. Allocated memory is still 142.6 MB. Free memory was 99.6 MB in the beginning and 88.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.87 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 88.4 MB in the beginning and 177.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 524.15 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 144.5 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2782.23 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 143.8 MB in the beginning and 215.5 MB in the end (delta: -71.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...