/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/res1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:28,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:28,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:28,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:28,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:28,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:28,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:28,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:28,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:28,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:28,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:28,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:28,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:28,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:28,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:28,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:28,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:28,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:28,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:28,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:28,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:28,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:28,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:28,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:28,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:28,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:28,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:28,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:28,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:28,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:28,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:28,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:28,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:28,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:28,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:28,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:28,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:28,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:28,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:28,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:28,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:28,628 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:49:28,643 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:28,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:28,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:28,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:28,645 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:28,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:28,645 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:28,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:28,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:28,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:28,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:28,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:28,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:28,647 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:28,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:28,647 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:28,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:28,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:28,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:28,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:28,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:28,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:28,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:28,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:28,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:28,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:28,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:28,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:28,650 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:28,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:28,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:28,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:28,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:28,933 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:28,933 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:28,934 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res1f.c [2020-07-17 22:49:29,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7408fc873/02ec271068c7480b831b6a3850b7c293/FLAGc7861da42 [2020-07-17 22:49:29,530 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:29,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res1f.c [2020-07-17 22:49:29,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7408fc873/02ec271068c7480b831b6a3850b7c293/FLAGc7861da42 [2020-07-17 22:49:29,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7408fc873/02ec271068c7480b831b6a3850b7c293 [2020-07-17 22:49:29,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:29,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:29,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:29,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:29,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:29,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:29" (1/1) ... [2020-07-17 22:49:29,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e73a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:29, skipping insertion in model container [2020-07-17 22:49:29,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:29" (1/1) ... [2020-07-17 22:49:29,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:29,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:30,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:30,134 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:30,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:30,270 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:30,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30 WrapperNode [2020-07-17 22:49:30,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:30,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:30,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:30,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:30,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (1/1) ... [2020-07-17 22:49:30,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:30,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:30,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:30,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:30,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (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:49:30,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:30,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:30,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:30,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:30,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:30,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:30,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:30,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:30,906 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:30,907 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:49:30,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:30 BoogieIcfgContainer [2020-07-17 22:49:30,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:30,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:30,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:30,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:30,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:29" (1/3) ... [2020-07-17 22:49:30,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672fc394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:30, skipping insertion in model container [2020-07-17 22:49:30,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:30" (2/3) ... [2020-07-17 22:49:30,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672fc394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:30, skipping insertion in model container [2020-07-17 22:49:30,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:30" (3/3) ... [2020-07-17 22:49:30,920 INFO L109 eAbstractionObserver]: Analyzing ICFG res1f.c [2020-07-17 22:49:30,931 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:30,939 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:30,953 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:30,974 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:30,974 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:30,975 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:30,975 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:30,975 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:30,976 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:30,976 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:30,976 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-17 22:49:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:49:31,001 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:31,002 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-17 22:49:31,003 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1562148239, now seen corresponding path program 1 times [2020-07-17 22:49:31,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:31,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122395395] [2020-07-17 22:49:31,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:31,258 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-17 22:49:31,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:49:31,260 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-17 22:49:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:31,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-17 22:49:31,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-17 22:49:31,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:49:31,275 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-17 22:49:31,277 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-17 22:49:31,278 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-17 22:49:31,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:49:31,279 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-17 22:49:31,279 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret12 := main(); {40#true} is VALID [2020-07-17 22:49:31,280 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-17 22:49:31,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID [2020-07-17 22:49:31,280 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-17 22:49:31,281 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-17 22:49:31,282 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-17 22:49:31,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:49:31,283 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-17 22:49:31,283 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(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:31,284 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-17 22:49:31,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:31,285 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-17 22:49:31,285 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:31,286 INFO L280 TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-17 22:49:31,286 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:31,286 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-17 22:49:31,287 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-17 22:49:31,287 INFO L263 TraceCheckUtils]: 21: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {41#false} is VALID [2020-07-17 22:49:31,288 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-17 22:49:31,288 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-17 22:49:31,289 INFO L280 TraceCheckUtils]: 24: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-17 22:49:31,292 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:49:31,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122395395] [2020-07-17 22:49:31,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:31,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:31,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370564316] [2020-07-17 22:49:31,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:49:31,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:31,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:31,369 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-17 22:49:31,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:31,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:31,383 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-17 22:49:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:31,628 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-17 22:49:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:31,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-17 22:49:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-17 22:49:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-17 22:49:31,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-17 22:49:31,816 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-17 22:49:31,830 INFO L225 Difference]: With dead ends: 64 [2020-07-17 22:49:31,830 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:49:31,834 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:49:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:49:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 22:49:31,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:31,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:31,898 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:31,898 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:31,904 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:49:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:31,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:31,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:31,905 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:31,905 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-17 22:49:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:31,910 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:49:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:31,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:31,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:31,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:31,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:49:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-17 22:49:31,916 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-17 22:49:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:31,917 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-17 22:49:31,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-17 22:49:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:49:31,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:31,919 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-17 22:49:31,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:31,920 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:31,920 INFO L82 PathProgramCache]: Analyzing trace with hash 369304979, now seen corresponding path program 1 times [2020-07-17 22:49:31,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:31,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729550507] [2020-07-17 22:49:31,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:32,079 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-17 22:49:32,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-17 22:49:32,080 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-17 22:49:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:32,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2020-07-17 22:49:32,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !(0 == ~cond); {236#true} is VALID [2020-07-17 22:49:32,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-17 22:49:32,097 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {241#(<= 1 ~N~0)} #91#return; {241#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:32,098 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-17 22:49:32,099 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-17 22:49:32,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-17 22:49:32,100 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-17 22:49:32,100 INFO L263 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret12 := main(); {236#true} is VALID [2020-07-17 22:49:32,100 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-17 22:49:32,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#true} assume !(~N~0 <= 0); {241#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:32,102 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-17 22:49:32,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#true} ~cond := #in~cond; {236#true} is VALID [2020-07-17 22:49:32,103 INFO L280 TraceCheckUtils]: 9: Hoare triple {236#true} assume !(0 == ~cond); {236#true} is VALID [2020-07-17 22:49:32,103 INFO L280 TraceCheckUtils]: 10: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-17 22:49:32,105 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {236#true} {241#(<= 1 ~N~0)} #91#return; {241#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:32,107 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(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {246#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:32,108 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-17 22:49:32,108 INFO L280 TraceCheckUtils]: 14: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-17 22:49:32,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-17 22:49:32,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-17 22:49:32,109 INFO L280 TraceCheckUtils]: 17: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-17 22:49:32,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-17 22:49:32,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-17 22:49:32,110 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-17 22:49:32,111 INFO L263 TraceCheckUtils]: 21: Hoare triple {237#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {237#false} is VALID [2020-07-17 22:49:32,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2020-07-17 22:49:32,111 INFO L280 TraceCheckUtils]: 23: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2020-07-17 22:49:32,112 INFO L280 TraceCheckUtils]: 24: Hoare triple {237#false} assume !false; {237#false} is VALID [2020-07-17 22:49:32,113 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:49:32,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729550507] [2020-07-17 22:49:32,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:32,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:32,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958093811] [2020-07-17 22:49:32,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-17 22:49:32,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:32,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:32,157 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-17 22:49:32,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:32,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:32,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:32,159 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-17 22:49:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:32,462 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2020-07-17 22:49:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:32,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-17 22:49:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-17 22:49:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:32,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-17 22:49:32,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-17 22:49:32,562 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-17 22:49:32,564 INFO L225 Difference]: With dead ends: 53 [2020-07-17 22:49:32,564 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:49:32,565 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:49:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:49:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-17 22:49:32,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:32,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-17 22:49:32,594 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-17 22:49:32,594 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-17 22:49:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:32,598 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-17 22:49:32,598 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-17 22:49:32,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:32,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:32,599 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-17 22:49:32,599 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-17 22:49:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:32,602 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-17 22:49:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-17 22:49:32,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:32,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:32,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:32,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:49:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-07-17 22:49:32,607 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2020-07-17 22:49:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:32,608 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-17 22:49:32,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-17 22:49:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:49:32,610 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:32,610 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-17 22:49:32,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:32,610 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1815337701, now seen corresponding path program 1 times [2020-07-17 22:49:32,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:32,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016819019] [2020-07-17 22:49:32,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:32,803 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:32,803 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:32,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:32,850 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:32,850 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:32,850 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:32,851 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:32,851 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:32,851 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:32,851 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:32,851 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:32,851 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:32,852 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:32,852 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:32,852 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:32,852 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:32,852 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:32,853 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:32,853 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:32,853 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:32,853 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:32,853 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:32,853 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:32,854 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:32,854 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:32,854 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:32,854 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:32,854 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:32,855 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:32,855 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:32,855 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:32,855 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:49:32,855 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:49:32,856 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:49:32,856 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-17 22:49:32,856 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-17 22:49:32,856 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-17 22:49:32,856 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:49:32,856 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:49:32,857 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:49:32,857 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-17 22:49:32,857 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-17 22:49:32,857 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:49:32,857 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:49:32,858 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:49:32,858 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-17 22:49:32,858 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-17 22:49:32,858 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:49:32,858 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:49:32,858 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:49:32,859 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-17 22:49:32,859 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:49:32,859 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:49:32,859 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-17 22:49:32,859 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:32,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:32 BoogieIcfgContainer [2020-07-17 22:49:32,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:32,866 INFO L168 Benchmark]: Toolchain (without parser) took 2978.99 ms. Allocated memory was 136.8 MB in the beginning and 231.7 MB in the end (delta: 94.9 MB). Free memory was 101.2 MB in the beginning and 93.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:32,867 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 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:32,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.50 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.7 MB in the beginning and 180.3 MB in the end (delta: -79.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:32,868 INFO L168 Benchmark]: Boogie Preprocessor took 47.44 ms. Allocated memory is still 201.9 MB. Free memory was 180.3 MB in the beginning and 177.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:32,870 INFO L168 Benchmark]: RCFGBuilder took 591.84 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 149.6 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:32,871 INFO L168 Benchmark]: TraceAbstraction took 1950.21 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 148.9 MB in the beginning and 93.2 MB in the end (delta: 55.7 MB). Peak memory consumption was 85.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:32,880 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.20 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 383.50 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.7 MB in the beginning and 180.3 MB in the end (delta: -79.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.44 ms. Allocated memory is still 201.9 MB. Free memory was 180.3 MB in the beginning and 177.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 591.84 ms. Allocated memory is still 201.9 MB. Free memory was 177.8 MB in the beginning and 149.6 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1950.21 ms. Allocated memory was 201.9 MB in the beginning and 231.7 MB in the end (delta: 29.9 MB). Free memory was 148.9 MB in the beginning and 93.2 MB in the end (delta: 55.7 MB). Peak memory consumption was 85.6 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] = 1 [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={5:0}, i=0, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L31] COND TRUE i