/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/s22iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:46,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:46,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:46,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:46,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:46,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:46,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:46,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:46,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:46,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:46,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:46,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:46,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:46,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:46,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:46,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:46,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:46,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:46,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:46,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:46,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:46,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:46,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:46,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:46,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:46,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:46,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:46,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:46,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:46,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:46,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:46,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:46,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:46,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:46,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:46,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:46,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:46,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:46,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:46,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:46,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:46,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:46,221 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:46,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:46,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:46,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:46,223 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:46,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:46,224 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:46,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:46,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:46,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:46,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:46,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:46,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:46,226 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:46,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:46,226 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:46,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:46,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:46,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:46,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:46,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:46,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:46,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:46,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:46,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:46,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:46,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:46,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:46,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:46,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:46,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:46,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:46,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:46,526 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:46,527 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:46,527 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s22iff.c [2020-07-10 15:26:46,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87fa4fc2/a59567cf187a4f14854099db544eb516/FLAG988650d0d [2020-07-10 15:26:47,046 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:47,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s22iff.c [2020-07-10 15:26:47,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87fa4fc2/a59567cf187a4f14854099db544eb516/FLAG988650d0d [2020-07-10 15:26:47,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87fa4fc2/a59567cf187a4f14854099db544eb516 [2020-07-10 15:26:47,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:47,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:47,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:47,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:47,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:47,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6902f5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47, skipping insertion in model container [2020-07-10 15:26:47,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:47,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:47,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:47,641 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:47,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:47,779 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:47,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47 WrapperNode [2020-07-10 15:26:47,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:47,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:47,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:47,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:47,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... [2020-07-10 15:26:47,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:47,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:47,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:47,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:47,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:47,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:47,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:47,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:47,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:47,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:47,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:47,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:47,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:47,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:47,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:47,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:47,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:47,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:48,380 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:48,380 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:48,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:48 BoogieIcfgContainer [2020-07-10 15:26:48,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:48,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:48,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:48,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:48,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:47" (1/3) ... [2020-07-10 15:26:48,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b32a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:48, skipping insertion in model container [2020-07-10 15:26:48,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:47" (2/3) ... [2020-07-10 15:26:48,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b32a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:48, skipping insertion in model container [2020-07-10 15:26:48,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:48" (3/3) ... [2020-07-10 15:26:48,392 INFO L109 eAbstractionObserver]: Analyzing ICFG s22iff.c [2020-07-10 15:26:48,402 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:48,410 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:48,424 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:48,443 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:48,443 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:48,443 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:48,443 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:48,443 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:48,444 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:48,444 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:48,444 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:26:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:48,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:48,465 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] [2020-07-10 15:26:48,465 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:48,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2033030480, now seen corresponding path program 1 times [2020-07-10 15:26:48,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:48,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218351466] [2020-07-10 15:26:48,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:48,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#(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; {39#true} is VALID [2020-07-10 15:26:48,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:48,680 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:48,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:48,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:48,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:48,693 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:48,696 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:48,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(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; {39#true} is VALID [2020-07-10 15:26:48,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:48,697 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:48,697 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2020-07-10 15:26:48,698 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {39#true} is VALID [2020-07-10 15:26:48,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-10 15:26:48,699 INFO L263 TraceCheckUtils]: 7: Hoare triple {39#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {39#true} is VALID [2020-07-10 15:26:48,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:48,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:48,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:48,701 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:48,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#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(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:48,702 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:48,703 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:48,703 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:48,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:48,704 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:26:48,704 INFO L280 TraceCheckUtils]: 18: Hoare triple {40#false} call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {40#false} is VALID [2020-07-10 15:26:48,705 INFO L263 TraceCheckUtils]: 19: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem13 == 3 * ~N~0 then 1 else 0)); {40#false} is VALID [2020-07-10 15:26:48,705 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-10 15:26:48,706 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-10 15:26:48,706 INFO L280 TraceCheckUtils]: 22: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:26:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:48,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218351466] [2020-07-10 15:26:48,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:48,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:48,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099069259] [2020-07-10 15:26:48,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:48,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:48,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:48,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:48,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:48,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:48,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:48,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:48,784 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-10 15:26:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:48,996 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-10 15:26:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:48,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:49,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-10 15:26:49,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:49,217 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:26:49,217 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:26:49,221 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:26:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:26:49,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:49,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:49,274 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:49,275 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,279 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:26:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:49,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:49,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:49,280 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:49,281 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,284 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:26:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:49,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:49,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:49,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:49,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:26:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:26:49,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2020-07-10 15:26:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:49,291 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:26:49,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:49,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:49,292 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] [2020-07-10 15:26:49,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:49,293 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:49,294 INFO L82 PathProgramCache]: Analyzing trace with hash 706992569, now seen corresponding path program 1 times [2020-07-10 15:26:49,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:49,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149453806] [2020-07-10 15:26:49,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:49,423 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(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; {227#true} is VALID [2020-07-10 15:26:49,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:49,424 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:26:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:49,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:26:49,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:26:49,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:49,454 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:49,460 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:49,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(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; {227#true} is VALID [2020-07-10 15:26:49,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:49,461 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:26:49,462 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret14 := main(); {227#true} is VALID [2020-07-10 15:26:49,462 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID [2020-07-10 15:26:49,463 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:49,463 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID [2020-07-10 15:26:49,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:26:49,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:26:49,464 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:49,465 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:49,466 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 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(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:49,471 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:49,472 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:26:49,472 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:49,472 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:26:49,472 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:49,473 INFO L280 TraceCheckUtils]: 18: Hoare triple {228#false} call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {228#false} is VALID [2020-07-10 15:26:49,473 INFO L263 TraceCheckUtils]: 19: Hoare triple {228#false} call __VERIFIER_assert((if #t~mem13 == 3 * ~N~0 then 1 else 0)); {228#false} is VALID [2020-07-10 15:26:49,473 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-10 15:26:49,474 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-10 15:26:49,474 INFO L280 TraceCheckUtils]: 22: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-10 15:26:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:49,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149453806] [2020-07-10 15:26:49,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:49,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:49,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122411145] [2020-07-10 15:26:49,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:49,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:49,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:49,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:49,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:49,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:49,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:49,518 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2020-07-10 15:26:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,806 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-07-10 15:26:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:49,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:26:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:26:49,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-10 15:26:49,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:49,919 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:26:49,919 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:26:49,922 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:49,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:26:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-07-10 15:26:49,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:49,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:49,967 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:49,967 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,972 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:26:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:26:49,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:49,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:49,976 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2020-07-10 15:26:49,976 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2020-07-10 15:26:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,986 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:26:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:26:49,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:49,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:49,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:49,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:26:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:26:49,994 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2020-07-10 15:26:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:49,995 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:26:49,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:26:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:26:49,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:49,998 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-10 15:26:49,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:49,999 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:49,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 284203188, now seen corresponding path program 1 times [2020-07-10 15:26:50,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:50,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539304003] [2020-07-10 15:26:50,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:50,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:50,221 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:50,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:50,298 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:50,299 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:50,300 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:50,301 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:50,301 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:50,301 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:50,301 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:50,301 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:50,301 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:50,302 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:50,302 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:50,302 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:50,302 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:50,302 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:50,302 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:50,303 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:50,303 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:50,303 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:50,303 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-10 15:26:50,303 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:50,303 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:50,304 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:50,305 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:50,305 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:50,305 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:50,305 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:26:50,305 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:50,305 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:50,306 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:26:50,306 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:26:50,306 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:50,306 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:50,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:50 BoogieIcfgContainer [2020-07-10 15:26:50,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:50,312 INFO L168 Benchmark]: Toolchain (without parser) took 2908.42 ms. Allocated memory was 146.8 MB in the beginning and 232.8 MB in the end (delta: 86.0 MB). Free memory was 104.4 MB in the beginning and 95.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:50,313 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:50,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.36 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 104.2 MB in the beginning and 183.0 MB in the end (delta: -78.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:50,315 INFO L168 Benchmark]: Boogie Preprocessor took 55.19 ms. Allocated memory is still 204.5 MB. Free memory was 183.0 MB in the beginning and 180.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:50,316 INFO L168 Benchmark]: RCFGBuilder took 546.56 ms. Allocated memory is still 204.5 MB. Free memory was 180.7 MB in the beginning and 153.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:50,317 INFO L168 Benchmark]: TraceAbstraction took 1923.74 ms. Allocated memory was 204.5 MB in the beginning and 232.8 MB in the end (delta: 28.3 MB). Free memory was 153.4 MB in the beginning and 95.3 MB in the end (delta: 58.2 MB). Peak memory consumption was 86.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:50,321 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.22 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 377.36 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 104.2 MB in the beginning and 183.0 MB in the end (delta: -78.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.19 ms. Allocated memory is still 204.5 MB. Free memory was 183.0 MB in the beginning and 180.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 546.56 ms. Allocated memory is still 204.5 MB. Free memory was 180.7 MB in the beginning and 153.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1923.74 ms. Allocated memory was 204.5 MB in the beginning and 232.8 MB in the end (delta: 28.3 MB). Free memory was 153.4 MB in the beginning and 95.3 MB in the end (delta: 58.2 MB). Peak memory consumption was 86.5 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] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i