/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/condgf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:48:54,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:54,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:54,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:54,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:54,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:54,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:54,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:54,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:54,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:54,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:54,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:54,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:54,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:54,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:54,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:54,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:54,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:54,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:54,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:54,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:54,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:54,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:54,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:54,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:54,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:54,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:54,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:54,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:54,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:54,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:54,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:54,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:54,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:54,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:54,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:54,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:54,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:54,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:54,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:54,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:54,730 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-17 22:48:54,767 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:54,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:54,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:54,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:54,772 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:54,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:54,772 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:54,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:54,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:54,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:54,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:54,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:54,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:54,773 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:54,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:54,774 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:54,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:54,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:54,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:54,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:54,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:54,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:54,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:54,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:54,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:54,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:54,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:54,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:54,777 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:54,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:55,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:55,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:55,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:55,092 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:55,093 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:55,093 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-17 22:48:55,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6867744b/942e9e368ff64d2e836ed523d10a0b38/FLAG8369f22c9 [2020-07-17 22:48:55,652 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:55,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condgf.c [2020-07-17 22:48:55,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6867744b/942e9e368ff64d2e836ed523d10a0b38/FLAG8369f22c9 [2020-07-17 22:48:56,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6867744b/942e9e368ff64d2e836ed523d10a0b38 [2020-07-17 22:48:56,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:56,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:56,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:56,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:56,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:56,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4559a9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56, skipping insertion in model container [2020-07-17 22:48:56,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:56,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:56,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:56,298 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:56,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:56,343 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:56,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56 WrapperNode [2020-07-17 22:48:56,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:56,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:56,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:56,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:56,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (1/1) ... [2020-07-17 22:48:56,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:56,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:56,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:56,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:56,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (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-17 22:48:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:48:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:48:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:48:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:48:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:48:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:56,552 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:48:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:48:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:48:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:56,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:56,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:56,975 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:56,975 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:48:56,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:56 BoogieIcfgContainer [2020-07-17 22:48:56,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:56,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:56,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:56,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:56,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:56" (1/3) ... [2020-07-17 22:48:56,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fcc4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:56, skipping insertion in model container [2020-07-17 22:48:56,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:56" (2/3) ... [2020-07-17 22:48:56,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66fcc4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:56, skipping insertion in model container [2020-07-17 22:48:56,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:56" (3/3) ... [2020-07-17 22:48:56,988 INFO L109 eAbstractionObserver]: Analyzing ICFG condgf.c [2020-07-17 22:48:56,998 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:57,006 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:57,021 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:57,045 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:57,046 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:57,046 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:57,046 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:57,046 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:57,046 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:57,047 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:57,047 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-17 22:48:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:48:57,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:57,074 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] [2020-07-17 22:48:57,075 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:57,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1314310818, now seen corresponding path program 1 times [2020-07-17 22:48:57,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:57,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328098079] [2020-07-17 22:48:57,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,331 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(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; {41#true} is VALID [2020-07-17 22:48:57,332 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-17 22:48:57,332 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #100#return; {41#true} is VALID [2020-07-17 22:48:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2020-07-17 22:48:57,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2020-07-17 22:48:57,351 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #96#return; {42#false} is VALID [2020-07-17 22:48:57,352 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:57,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#(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; {41#true} is VALID [2020-07-17 22:48:57,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-17 22:48:57,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #100#return; {41#true} is VALID [2020-07-17 22:48:57,354 INFO L263 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret12 := main(); {41#true} is VALID [2020-07-17 22:48:57,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {41#true} is VALID [2020-07-17 22:48:57,355 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} assume !(~N~0 <= 0); {41#true} is VALID [2020-07-17 22:48:57,355 INFO L263 TraceCheckUtils]: 7: Hoare triple {41#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {41#true} is VALID [2020-07-17 22:48:57,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2020-07-17 22:48:57,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2020-07-17 22:48:57,357 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2020-07-17 22:48:57,357 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {42#false} {41#true} #96#return; {42#false} is VALID [2020-07-17 22:48:57,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#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 write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {42#false} is VALID [2020-07-17 22:48:57,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#false} assume !(~i~0 < ~N~0); {42#false} is VALID [2020-07-17 22:48:57,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2020-07-17 22:48:57,359 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#false} assume !(~i~0 < ~N~0); {42#false} is VALID [2020-07-17 22:48:57,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2020-07-17 22:48:57,360 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} assume !(~i~0 < ~N~0); {42#false} is VALID [2020-07-17 22:48:57,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2020-07-17 22:48:57,361 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {42#false} is VALID [2020-07-17 22:48:57,361 INFO L263 TraceCheckUtils]: 20: Hoare triple {42#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {42#false} is VALID [2020-07-17 22:48:57,362 INFO L280 TraceCheckUtils]: 21: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2020-07-17 22:48:57,362 INFO L280 TraceCheckUtils]: 22: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2020-07-17 22:48:57,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-17 22:48:57,366 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-17 22:48:57,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328098079] [2020-07-17 22:48:57,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:57,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:57,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249465782] [2020-07-17 22:48:57,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:48:57,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:57,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:57,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:57,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:57,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:57,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:57,446 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-17 22:48:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,669 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2020-07-17 22:48:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:57,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:48:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:48:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2020-07-17 22:48:57,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2020-07-17 22:48:57,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:57,866 INFO L225 Difference]: With dead ends: 66 [2020-07-17 22:48:57,867 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:48:57,870 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-17 22:48:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:48:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-17 22:48:57,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:57,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:57,922 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:57,923 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,928 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:48:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:48:57,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:57,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:57,929 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:57,929 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:48:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,934 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:48:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:48:57,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:57,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:57,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:57,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:48:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-17 22:48:57,941 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2020-07-17 22:48:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:57,941 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-17 22:48:57,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:48:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:48:57,943 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:57,943 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] [2020-07-17 22:48:57,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:48:57,944 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash 34447140, now seen corresponding path program 1 times [2020-07-17 22:48:57,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:57,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958833982] [2020-07-17 22:48:57,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,117 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#(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; {248#true} is VALID [2020-07-17 22:48:58,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-17 22:48:58,118 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {248#true} {248#true} #100#return; {248#true} is VALID [2020-07-17 22:48:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:58,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {248#true} ~cond := #in~cond; {248#true} is VALID [2020-07-17 22:48:58,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {248#true} assume !(0 == ~cond); {248#true} is VALID [2020-07-17 22:48:58,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-17 22:48:58,130 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {248#true} {253#(<= 1 ~N~0)} #96#return; {253#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:58,132 INFO L263 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {259#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:58,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {259#(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; {248#true} is VALID [2020-07-17 22:48:58,132 INFO L280 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-17 22:48:58,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #100#return; {248#true} is VALID [2020-07-17 22:48:58,133 INFO L263 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret12 := main(); {248#true} is VALID [2020-07-17 22:48:58,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {248#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {248#true} is VALID [2020-07-17 22:48:58,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {248#true} assume !(~N~0 <= 0); {253#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:58,135 INFO L263 TraceCheckUtils]: 7: Hoare triple {253#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {248#true} is VALID [2020-07-17 22:48:58,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#true} ~cond := #in~cond; {248#true} is VALID [2020-07-17 22:48:58,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {248#true} assume !(0 == ~cond); {248#true} is VALID [2020-07-17 22:48:58,136 INFO L280 TraceCheckUtils]: 10: Hoare triple {248#true} assume true; {248#true} is VALID [2020-07-17 22:48:58,137 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {248#true} {253#(<= 1 ~N~0)} #96#return; {253#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:58,139 INFO L280 TraceCheckUtils]: 12: Hoare triple {253#(<= 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 write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {258#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:48:58,141 INFO L280 TraceCheckUtils]: 13: Hoare triple {258#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {249#false} is VALID [2020-07-17 22:48:58,142 INFO L280 TraceCheckUtils]: 14: Hoare triple {249#false} ~i~0 := 0; {249#false} is VALID [2020-07-17 22:48:58,142 INFO L280 TraceCheckUtils]: 15: Hoare triple {249#false} assume !(~i~0 < ~N~0); {249#false} is VALID [2020-07-17 22:48:58,142 INFO L280 TraceCheckUtils]: 16: Hoare triple {249#false} ~i~0 := 0; {249#false} is VALID [2020-07-17 22:48:58,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {249#false} assume !(~i~0 < ~N~0); {249#false} is VALID [2020-07-17 22:48:58,143 INFO L280 TraceCheckUtils]: 18: Hoare triple {249#false} ~i~0 := 0; {249#false} is VALID [2020-07-17 22:48:58,143 INFO L280 TraceCheckUtils]: 19: Hoare triple {249#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {249#false} is VALID [2020-07-17 22:48:58,143 INFO L263 TraceCheckUtils]: 20: Hoare triple {249#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {249#false} is VALID [2020-07-17 22:48:58,144 INFO L280 TraceCheckUtils]: 21: Hoare triple {249#false} ~cond := #in~cond; {249#false} is VALID [2020-07-17 22:48:58,144 INFO L280 TraceCheckUtils]: 22: Hoare triple {249#false} assume 0 == ~cond; {249#false} is VALID [2020-07-17 22:48:58,144 INFO L280 TraceCheckUtils]: 23: Hoare triple {249#false} assume !false; {249#false} is VALID [2020-07-17 22:48:58,146 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-17 22:48:58,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958833982] [2020-07-17 22:48:58,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:58,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:48:58,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934634194] [2020-07-17 22:48:58,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:48:58,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:58,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:48:58,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:58,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:48:58,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:48:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:58,184 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2020-07-17 22:48:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,521 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2020-07-17 22:48:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:48:58,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:48:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-17 22:48:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2020-07-17 22:48:58,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2020-07-17 22:48:58,640 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-17 22:48:58,643 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:48:58,644 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:48:58,645 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-17 22:48:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:48:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2020-07-17 22:48:58,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:58,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2020-07-17 22:48:58,679 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2020-07-17 22:48:58,679 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2020-07-17 22:48:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,685 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-17 22:48:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-17 22:48:58,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,686 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2020-07-17 22:48:58,687 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2020-07-17 22:48:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,691 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-17 22:48:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2020-07-17 22:48:58,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:58,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:48:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-07-17 22:48:58,696 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2020-07-17 22:48:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:58,697 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-07-17 22:48:58,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:48:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-17 22:48:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:48:58,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,698 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] [2020-07-17 22:48:58,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:48:58,699 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1408881596, now seen corresponding path program 1 times [2020-07-17 22:48:58,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:58,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827632649] [2020-07-17 22:48:58,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {504#(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; {488#true} is VALID [2020-07-17 22:48:59,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-17 22:48:59,172 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {488#true} {488#true} #100#return; {488#true} is VALID [2020-07-17 22:48:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-17 22:48:59,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-17 22:48:59,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-17 22:48:59,179 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2020-07-17 22:48:59,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {504#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:59,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {504#(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; {488#true} is VALID [2020-07-17 22:48:59,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-17 22:48:59,181 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #100#return; {488#true} is VALID [2020-07-17 22:48:59,181 INFO L263 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret12 := main(); {488#true} is VALID [2020-07-17 22:48:59,181 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {488#true} is VALID [2020-07-17 22:48:59,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#true} assume !(~N~0 <= 0); {488#true} is VALID [2020-07-17 22:48:59,182 INFO L263 TraceCheckUtils]: 7: Hoare triple {488#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {488#true} is VALID [2020-07-17 22:48:59,182 INFO L280 TraceCheckUtils]: 8: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-17 22:48:59,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-17 22:48:59,183 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-17 22:48:59,183 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2020-07-17 22:48:59,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#true} 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 write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {497#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-17 22:48:59,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {497#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {498#(and (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-17 22:48:59,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {498#(and (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {499#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-17 22:48:59,191 INFO L280 TraceCheckUtils]: 15: Hoare triple {499#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {500#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (<= ~N~0 1) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-17 22:48:59,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {500#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (<= ~N~0 1) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 0; {501#(and (not (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) ~N~0)) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-17 22:48:59,194 INFO L280 TraceCheckUtils]: 17: Hoare triple {501#(and (not (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) ~N~0)) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-17 22:48:59,195 INFO L280 TraceCheckUtils]: 18: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-17 22:48:59,196 INFO L280 TraceCheckUtils]: 19: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} assume !(~i~0 < ~N~0); {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-17 22:48:59,197 INFO L280 TraceCheckUtils]: 20: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} ~i~0 := 0; {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} is VALID [2020-07-17 22:48:59,198 INFO L280 TraceCheckUtils]: 21: Hoare triple {502#(not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {503#(not (= ~N~0 |main_#t~mem7|))} is VALID [2020-07-17 22:48:59,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {503#(not (= ~N~0 |main_#t~mem7|))} assume #t~mem7 == ~N~0;havoc #t~mem7;call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 - 1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {489#false} is VALID [2020-07-17 22:48:59,199 INFO L280 TraceCheckUtils]: 23: Hoare triple {489#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {489#false} is VALID [2020-07-17 22:48:59,200 INFO L280 TraceCheckUtils]: 24: Hoare triple {489#false} assume !(~i~0 < ~N~0); {489#false} is VALID [2020-07-17 22:48:59,200 INFO L280 TraceCheckUtils]: 25: Hoare triple {489#false} ~i~0 := 0; {489#false} is VALID [2020-07-17 22:48:59,200 INFO L280 TraceCheckUtils]: 26: Hoare triple {489#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {489#false} is VALID [2020-07-17 22:48:59,200 INFO L263 TraceCheckUtils]: 27: Hoare triple {489#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {489#false} is VALID [2020-07-17 22:48:59,201 INFO L280 TraceCheckUtils]: 28: Hoare triple {489#false} ~cond := #in~cond; {489#false} is VALID [2020-07-17 22:48:59,201 INFO L280 TraceCheckUtils]: 29: Hoare triple {489#false} assume 0 == ~cond; {489#false} is VALID [2020-07-17 22:48:59,201 INFO L280 TraceCheckUtils]: 30: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-17 22:48:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:48:59,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827632649] [2020-07-17 22:48:59,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100781297] [2020-07-17 22:48:59,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:48:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:59,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:59,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:48:59,405 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,413 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:59,413 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,414 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-07-17 22:48:59,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:48:59,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-17 22:48:59,466 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,476 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:59,476 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,477 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-07-17 22:48:59,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:48:59,711 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2020-07-17 22:48:59,716 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,726 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:59,730 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 22:48:59,730 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2020-07-17 22:48:59,739 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:48:59,740 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, main_~a~0.base, main_~a~0.offset]. (let ((.cse1 (select |v_#memory_int_17| |main_~#sum~0.base|))) (let ((.cse0 (select (select |v_#memory_int_17| main_~a~0.base) main_~a~0.offset)) (.cse2 (select .cse1 |main_~#sum~0.offset|))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_17| |main_~#sum~0.base| (store .cse1 |main_~#sum~0.offset| (+ .cse2 .cse0)))) (<= ~N~0 1) (= 0 .cse2) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)))) [2020-07-17 22:48:59,740 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~a~0.offset]. (and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)) [2020-07-17 22:48:59,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 22:48:59,904 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-17 22:48:59,907 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,917 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:59,919 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:59,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:7 [2020-07-17 22:48:59,928 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:48:59,928 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#sum~0.base|, |main_~#sum~0.offset|, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= .cse0 2) (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= .cse0 |main_#t~mem7|) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-17 22:48:59,929 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 2 |main_#t~mem7|) (<= ~N~0 1)) [2020-07-17 22:48:59,976 INFO L263 TraceCheckUtils]: 0: Hoare triple {488#true} call ULTIMATE.init(); {488#true} is VALID [2020-07-17 22:48:59,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {488#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {488#true} is VALID [2020-07-17 22:48:59,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-17 22:48:59,977 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {488#true} {488#true} #100#return; {488#true} is VALID [2020-07-17 22:48:59,977 INFO L263 TraceCheckUtils]: 4: Hoare triple {488#true} call #t~ret12 := main(); {488#true} is VALID [2020-07-17 22:48:59,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {488#true} is VALID [2020-07-17 22:48:59,978 INFO L280 TraceCheckUtils]: 6: Hoare triple {488#true} assume !(~N~0 <= 0); {488#true} is VALID [2020-07-17 22:48:59,978 INFO L263 TraceCheckUtils]: 7: Hoare triple {488#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {488#true} is VALID [2020-07-17 22:48:59,978 INFO L280 TraceCheckUtils]: 8: Hoare triple {488#true} ~cond := #in~cond; {488#true} is VALID [2020-07-17 22:48:59,979 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#true} assume !(0 == ~cond); {488#true} is VALID [2020-07-17 22:48:59,979 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#true} assume true; {488#true} is VALID [2020-07-17 22:48:59,979 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {488#true} {488#true} #96#return; {488#true} is VALID [2020-07-17 22:48:59,981 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#true} 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 write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {544#(and (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:48:59,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {544#(and (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {548#(and (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:48:59,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {548#(and (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {552#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:48:59,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {552#(and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(~i~0 < ~N~0); {556#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:48:59,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {556#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} ~i~0 := 0; {560#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-17 22:48:59,989 INFO L280 TraceCheckUtils]: 17: Hoare triple {560#(and (<= ~N~0 1) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-17 22:48:59,990 INFO L280 TraceCheckUtils]: 18: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-17 22:48:59,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} assume !(~i~0 < ~N~0); {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-17 22:48:59,993 INFO L280 TraceCheckUtils]: 20: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} ~i~0 := 0; {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} is VALID [2020-07-17 22:49:00,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {564#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (<= ~N~0 1) (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))))} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {577#(and (<= 2 |main_#t~mem7|) (<= ~N~0 1))} is VALID [2020-07-17 22:49:00,006 INFO L280 TraceCheckUtils]: 22: Hoare triple {577#(and (<= 2 |main_#t~mem7|) (<= ~N~0 1))} assume #t~mem7 == ~N~0;havoc #t~mem7;call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 - 1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem8; {489#false} is VALID [2020-07-17 22:49:00,007 INFO L280 TraceCheckUtils]: 23: Hoare triple {489#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {489#false} is VALID [2020-07-17 22:49:00,007 INFO L280 TraceCheckUtils]: 24: Hoare triple {489#false} assume !(~i~0 < ~N~0); {489#false} is VALID [2020-07-17 22:49:00,007 INFO L280 TraceCheckUtils]: 25: Hoare triple {489#false} ~i~0 := 0; {489#false} is VALID [2020-07-17 22:49:00,008 INFO L280 TraceCheckUtils]: 26: Hoare triple {489#false} assume !!(~i~0 < ~N~0);call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {489#false} is VALID [2020-07-17 22:49:00,008 INFO L263 TraceCheckUtils]: 27: Hoare triple {489#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {489#false} is VALID [2020-07-17 22:49:00,008 INFO L280 TraceCheckUtils]: 28: Hoare triple {489#false} ~cond := #in~cond; {489#false} is VALID [2020-07-17 22:49:00,008 INFO L280 TraceCheckUtils]: 29: Hoare triple {489#false} assume 0 == ~cond; {489#false} is VALID [2020-07-17 22:49:00,009 INFO L280 TraceCheckUtils]: 30: Hoare triple {489#false} assume !false; {489#false} is VALID [2020-07-17 22:49:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:00,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:49:00,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-17 22:49:00,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980656480] [2020-07-17 22:49:00,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-17 22:49:00,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:00,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-17 22:49:00,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:00,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 22:49:00,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 22:49:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:49:00,074 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 17 states. [2020-07-17 22:49:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:01,843 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2020-07-17 22:49:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:49:01,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2020-07-17 22:49:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:49:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-17 22:49:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-17 22:49:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2020-07-17 22:49:01,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2020-07-17 22:49:01,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:01,961 INFO L225 Difference]: With dead ends: 71 [2020-07-17 22:49:01,962 INFO L226 Difference]: Without dead ends: 57 [2020-07-17 22:49:01,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2020-07-17 22:49:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-17 22:49:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2020-07-17 22:49:02,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:02,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 48 states. [2020-07-17 22:49:02,014 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 48 states. [2020-07-17 22:49:02,014 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 48 states. [2020-07-17 22:49:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,018 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2020-07-17 22:49:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2020-07-17 22:49:02,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,019 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 57 states. [2020-07-17 22:49:02,020 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 57 states. [2020-07-17 22:49:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:02,023 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2020-07-17 22:49:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2020-07-17 22:49:02,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:02,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:02,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:02,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 22:49:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2020-07-17 22:49:02,027 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 31 [2020-07-17 22:49:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:02,028 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2020-07-17 22:49:02,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 22:49:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:49:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:49:02,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:02,029 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] [2020-07-17 22:49:02,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:49:02,244 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:02,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:02,245 INFO L82 PathProgramCache]: Analyzing trace with hash -728823226, now seen corresponding path program 1 times [2020-07-17 22:49:02,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:02,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167059334] [2020-07-17 22:49:02,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:02,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:02,324 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:02,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:02,362 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:02,363 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:02,364 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:02,365 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:02,366 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:49:02,367 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:49:02,368 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-17 22:49:02,368 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-17 22:49:02,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:02 BoogieIcfgContainer [2020-07-17 22:49:02,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:02,374 INFO L168 Benchmark]: Toolchain (without parser) took 6333.01 ms. Allocated memory was 146.3 MB in the beginning and 278.9 MB in the end (delta: 132.6 MB). Free memory was 104.2 MB in the beginning and 206.8 MB in the end (delta: -102.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,375 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.65 ms. Allocated memory is still 146.3 MB. Free memory was 103.8 MB in the beginning and 92.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,376 INFO L168 Benchmark]: Boogie Preprocessor took 130.75 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 180.7 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,377 INFO L168 Benchmark]: RCFGBuilder took 501.20 ms. Allocated memory is still 203.4 MB. Free memory was 180.7 MB in the beginning and 153.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,378 INFO L168 Benchmark]: TraceAbstraction took 5390.56 ms. Allocated memory was 203.4 MB in the beginning and 278.9 MB in the end (delta: 75.5 MB). Free memory was 153.1 MB in the beginning and 206.8 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:02,382 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 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.65 ms. Allocated memory is still 146.3 MB. Free memory was 103.8 MB in the beginning and 92.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.75 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 180.7 MB in the end (delta: -88.1 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 501.20 ms. Allocated memory is still 203.4 MB. Free memory was 180.7 MB in the beginning and 153.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5390.56 ms. Allocated memory was 203.4 MB in the beginning and 278.9 MB in the end (delta: 75.5 MB). Free memory was 153.1 MB in the beginning and 206.8 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.7 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); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L30] COND TRUE i