/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/res1of.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:41,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:41,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:41,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:41,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:41,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:41,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:41,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:41,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:41,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:41,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:41,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:41,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:41,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:41,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:41,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:41,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:41,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:41,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:41,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:41,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:41,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:41,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:41,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:41,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:41,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:41,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:41,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:41,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:41,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:41,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:41,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:41,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:41,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:41,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:41,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:41,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:41,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:41,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:41,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:41,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:41,535 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:41,550 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:41,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:41,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:41,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:41,552 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:41,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:41,553 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:41,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:41,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:41,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:41,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:41,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:41,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:41,554 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:41,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:41,554 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:41,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:41,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:41,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:41,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:41,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:41,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:41,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:41,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:41,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:41,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:41,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:41,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:41,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:41,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:41,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:41,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:41,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:41,898 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:41,898 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:41,899 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res1of.c [2020-07-10 15:26:41,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2565db5c/e6cf1678971249df8e1a4e5c155d1945/FLAG82cb7b2ef [2020-07-10 15:26:42,455 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:42,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res1of.c [2020-07-10 15:26:42,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2565db5c/e6cf1678971249df8e1a4e5c155d1945/FLAG82cb7b2ef [2020-07-10 15:26:42,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2565db5c/e6cf1678971249df8e1a4e5c155d1945 [2020-07-10 15:26:42,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:42,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:42,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:42,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:42,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:42,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:42" (1/1) ... [2020-07-10 15:26:42,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e0b013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:42, skipping insertion in model container [2020-07-10 15:26:42,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:42" (1/1) ... [2020-07-10 15:26:42,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:42,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:43,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:43,118 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:43,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:43,330 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:43,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43 WrapperNode [2020-07-10 15:26:43,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:43,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:43,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:43,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:43,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (1/1) ... [2020-07-10 15:26:43,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:43,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:43,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:43,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:43,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (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-10 15:26:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:43,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:43,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:43,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:43,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:43,924 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:43,924 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:26:43,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:43 BoogieIcfgContainer [2020-07-10 15:26:43,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:43,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:43,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:43,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:43,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:42" (1/3) ... [2020-07-10 15:26:43,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a765d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:43, skipping insertion in model container [2020-07-10 15:26:43,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:43" (2/3) ... [2020-07-10 15:26:43,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a765d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:43, skipping insertion in model container [2020-07-10 15:26:43,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:43" (3/3) ... [2020-07-10 15:26:43,936 INFO L109 eAbstractionObserver]: Analyzing ICFG res1of.c [2020-07-10 15:26:43,946 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:43,954 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:43,969 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:43,991 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:43,991 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:43,991 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:43,992 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:43,992 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:43,992 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:43,992 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:43,993 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-10 15:26:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:26:44,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:44,022 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] [2020-07-10 15:26:44,022 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1562148239, now seen corresponding path program 1 times [2020-07-10 15:26:44,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:44,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887160512] [2020-07-10 15:26:44,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:44,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {40#true} is VALID [2020-07-10 15:26:44,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:26:44,276 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:26:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:44,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:26:44,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:26:44,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:26:44,294 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:26:44,296 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:44,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {40#true} is VALID [2020-07-10 15:26:44,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:26:44,298 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:26:44,298 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2020-07-10 15:26:44,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {40#true} is VALID [2020-07-10 15:26:44,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID [2020-07-10 15:26:44,300 INFO L263 TraceCheckUtils]: 7: Hoare triple {40#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {40#true} is VALID [2020-07-10 15:26:44,300 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:26:44,301 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:26:44,302 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:26:44,303 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:26:44,303 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:44,304 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:44,304 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:44,304 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:44,305 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:44,305 INFO L280 TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:44,306 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:44,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-10 15:26:44,306 INFO L280 TraceCheckUtils]: 20: Hoare triple {41#false} call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {41#false} is VALID [2020-07-10 15:26:44,307 INFO L263 TraceCheckUtils]: 21: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem11 <= ~N~0 then 1 else 0)); {41#false} is VALID [2020-07-10 15:26:44,307 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-10 15:26:44,307 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-10 15:26:44,308 INFO L280 TraceCheckUtils]: 24: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-10 15:26:44,311 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-10 15:26:44,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887160512] [2020-07-10 15:26:44,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:44,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:44,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167303651] [2020-07-10 15:26:44,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:26:44,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:44,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:44,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:44,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:44,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:44,395 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-10 15:26:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:44,617 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-10 15:26:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:44,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:26:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:26:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:26:44,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-10 15:26:44,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:44,800 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:26:44,801 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:26:44,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-10 15:26:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:26:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 15:26:44,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:44,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:44,862 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:44,862 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:44,867 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:44,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:44,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:44,868 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:44,868 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:26:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:44,873 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:44,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:44,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:44,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:44,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:26:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:26:44,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-10 15:26:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:44,879 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:26:44,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:26:44,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:44,881 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] [2020-07-10 15:26:44,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:44,882 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 369304979, now seen corresponding path program 1 times [2020-07-10 15:26:44,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:44,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142736236] [2020-07-10 15:26:44,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:45,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {236#true} is VALID [2020-07-10 15:26:45,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:45,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-10 15:26:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:45,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2020-07-10 15:26:45,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !(0 == ~cond); {236#true} is VALID [2020-07-10 15:26:45,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:45,066 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {241#(<= 1 ~N~0)} #91#return; {241#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:45,067 INFO L263 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {247#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:45,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {236#true} is VALID [2020-07-10 15:26:45,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:45,068 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-10 15:26:45,069 INFO L263 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret12 := main(); {236#true} is VALID [2020-07-10 15:26:45,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {236#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {236#true} is VALID [2020-07-10 15:26:45,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#true} assume !(~N~0 <= 0); {241#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:45,071 INFO L263 TraceCheckUtils]: 7: Hoare triple {241#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {236#true} is VALID [2020-07-10 15:26:45,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2020-07-10 15:26:45,071 INFO L280 TraceCheckUtils]: 9: Hoare triple {236#true} assume !(0 == ~cond); {236#true} is VALID [2020-07-10 15:26:45,072 INFO L280 TraceCheckUtils]: 10: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:26:45,073 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {236#true} {241#(<= 1 ~N~0)} #91#return; {241#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:45,076 INFO L280 TraceCheckUtils]: 12: Hoare triple {241#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {246#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:45,077 INFO L280 TraceCheckUtils]: 13: Hoare triple {246#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:45,077 INFO L280 TraceCheckUtils]: 14: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:26:45,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:45,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:26:45,078 INFO L280 TraceCheckUtils]: 17: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:45,078 INFO L280 TraceCheckUtils]: 18: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:26:45,079 INFO L280 TraceCheckUtils]: 19: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:26:45,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {237#false} call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {237#false} is VALID [2020-07-10 15:26:45,079 INFO L263 TraceCheckUtils]: 21: Hoare triple {237#false} call __VERIFIER_assert((if #t~mem11 <= ~N~0 then 1 else 0)); {237#false} is VALID [2020-07-10 15:26:45,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2020-07-10 15:26:45,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2020-07-10 15:26:45,080 INFO L280 TraceCheckUtils]: 24: Hoare triple {237#false} assume !false; {237#false} is VALID [2020-07-10 15:26:45,081 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-10 15:26:45,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142736236] [2020-07-10 15:26:45,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:45,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:45,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594853263] [2020-07-10 15:26:45,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-10 15:26:45,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:45,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:45,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:45,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:45,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:45,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:45,120 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-10 15:26:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:45,411 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2020-07-10 15:26:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:45,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-10 15:26:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 15:26:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 15:26:45,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-10 15:26:45,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:45,516 INFO L225 Difference]: With dead ends: 53 [2020-07-10 15:26:45,516 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:26:45,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:26:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-10 15:26:45,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:45,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-10 15:26:45,546 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-10 15:26:45,546 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-10 15:26:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:45,549 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-10 15:26:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:26:45,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:45,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:45,550 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-10 15:26:45,551 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-10 15:26:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:45,554 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-10 15:26:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:26:45,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:45,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:45,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:45,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:26:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-07-10 15:26:45,558 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2020-07-10 15:26:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:45,558 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-10 15:26:45,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-10 15:26:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:26:45,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:45,560 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] [2020-07-10 15:26:45,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:45,561 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1815337701, now seen corresponding path program 1 times [2020-07-10 15:26:45,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:45,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457727127] [2020-07-10 15:26:45,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:45,783 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:45,784 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:45,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:45,876 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:45,876 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:45,877 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:45,877 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:45,877 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:45,877 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:45,877 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:45,877 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:45,878 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:45,881 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:45,882 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:45,882 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:45,883 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:45,888 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:45,888 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:45,888 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:45,888 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:45,889 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:45,889 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:45,889 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:45,889 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:45,890 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:45,891 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:45,891 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:45,891 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:45,892 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:45,892 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:45,892 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:45,892 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:26:45,892 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:26:45,892 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:26:45,893 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:26:45,894 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:26:45,894 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:26:45,894 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:26:45,895 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:26:45,895 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-10 15:26:45,895 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:26:45,895 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:45,895 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:45,895 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:26:45,896 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-10 15:26:45,896 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:26:45,896 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:26:45,896 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:26:45,896 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:45,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:45 BoogieIcfgContainer [2020-07-10 15:26:45,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:45,906 INFO L168 Benchmark]: Toolchain (without parser) took 3091.27 ms. Allocated memory was 140.0 MB in the beginning and 225.4 MB in the end (delta: 85.5 MB). Free memory was 99.1 MB in the beginning and 93.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 90.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:45,909 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:45,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.81 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 98.9 MB in the beginning and 179.2 MB in the end (delta: -80.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:45,911 INFO L168 Benchmark]: Boogie Preprocessor took 50.49 ms. Allocated memory is still 200.3 MB. Free memory was 179.2 MB in the beginning and 176.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:45,913 INFO L168 Benchmark]: RCFGBuilder took 545.49 ms. Allocated memory is still 200.3 MB. Free memory was 176.7 MB in the beginning and 148.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:45,915 INFO L168 Benchmark]: TraceAbstraction took 1972.44 ms. Allocated memory was 200.3 MB in the beginning and 225.4 MB in the end (delta: 25.2 MB). Free memory was 147.8 MB in the beginning and 93.6 MB in the end (delta: 54.2 MB). Peak memory consumption was 79.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:45,929 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.21 ms. Allocated memory is still 140.0 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 516.81 ms. Allocated memory was 140.0 MB in the beginning and 200.3 MB in the end (delta: 60.3 MB). Free memory was 98.9 MB in the beginning and 179.2 MB in the end (delta: -80.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.49 ms. Allocated memory is still 200.3 MB. Free memory was 179.2 MB in the beginning and 176.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 545.49 ms. Allocated memory is still 200.3 MB. Free memory was 176.7 MB in the beginning and 148.5 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1972.44 ms. Allocated memory was 200.3 MB in the beginning and 225.4 MB in the end (delta: 25.2 MB). Free memory was 147.8 MB in the beginning and 93.6 MB in the end (delta: 54.2 MB). Peak memory consumption was 79.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L28] int *b = malloc(sizeof(int)*N); [L30] sum[0] = 0 [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=0, malloc(sizeof(int)*N)={-1:0}, malloc(sizeof(int)*N)={-2:0}, N=1, sum={3:0}] [L31] COND TRUE i