/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/sina1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:17,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:17,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:17,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:17,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:17,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:17,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:17,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:17,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:17,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:17,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:17,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:17,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:17,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:17,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:17,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:17,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:17,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:17,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:17,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:17,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:17,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:17,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:17,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:17,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:17,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:17,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:17,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:17,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:17,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:17,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:17,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:17,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:17,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:17,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:17,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:17,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:17,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:17,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:17,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:17,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:17,478 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-08 12:45:17,491 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:17,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:17,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:17,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:17,493 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:17,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:17,494 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:17,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:17,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:17,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:17,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:17,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:17,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:17,495 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:17,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:17,495 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:17,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:17,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:17,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:17,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:17,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:17,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:17,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:17,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:17,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:17,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:17,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:17,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:17,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:17,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:17,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:17,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:17,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:17,798 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:17,798 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:17,799 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-08 12:45:17,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42674bcc/df7c4613f5ed4bcd94283fa4bf0e768f/FLAGf35e12cb8 [2020-07-08 12:45:18,327 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:18,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina1f.c [2020-07-08 12:45:18,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42674bcc/df7c4613f5ed4bcd94283fa4bf0e768f/FLAGf35e12cb8 [2020-07-08 12:45:18,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42674bcc/df7c4613f5ed4bcd94283fa4bf0e768f [2020-07-08 12:45:18,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:18,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:18,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:18,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:18,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:18,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:18" (1/1) ... [2020-07-08 12:45:18,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7bc14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:18, skipping insertion in model container [2020-07-08 12:45:18,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:18" (1/1) ... [2020-07-08 12:45:18,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:18,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:18,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:19,004 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:19,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:19,053 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:19,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19 WrapperNode [2020-07-08 12:45:19,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:19,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:19,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:19,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:19,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (1/1) ... [2020-07-08 12:45:19,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:19,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:19,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:19,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:19,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (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-08 12:45:19,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:45:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:45:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:45:19,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:19,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:19,258 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:45:19,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:19,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:19,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:45:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:45:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:45:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:19,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:19,621 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:19,621 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:45:19,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:19 BoogieIcfgContainer [2020-07-08 12:45:19,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:19,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:19,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:19,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:19,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:18" (1/3) ... [2020-07-08 12:45:19,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195dbec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:19, skipping insertion in model container [2020-07-08 12:45:19,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:19" (2/3) ... [2020-07-08 12:45:19,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195dbec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:19, skipping insertion in model container [2020-07-08 12:45:19,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:19" (3/3) ... [2020-07-08 12:45:19,633 INFO L109 eAbstractionObserver]: Analyzing ICFG sina1f.c [2020-07-08 12:45:19,643 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:19,650 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:19,664 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:19,686 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:19,687 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:19,687 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:19,687 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:19,687 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:19,687 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:19,688 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:19,688 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 12:45:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:45:19,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:19,714 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] [2020-07-08 12:45:19,714 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1314760119, now seen corresponding path program 1 times [2020-07-08 12:45:19,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:19,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062024412] [2020-07-08 12:45:19,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:19,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(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; {37#true} is VALID [2020-07-08 12:45:19,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 12:45:19,985 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-08 12:45:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:19,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-08 12:45:20,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-08 12:45:20,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-08 12:45:20,001 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-08 12:45:20,003 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {46#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:20,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#(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; {37#true} is VALID [2020-07-08 12:45:20,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 12:45:20,004 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2020-07-08 12:45:20,004 INFO L263 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2020-07-08 12:45:20,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {37#true} is VALID [2020-07-08 12:45:20,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~N~0 <= 0); {37#true} is VALID [2020-07-08 12:45:20,006 INFO L263 TraceCheckUtils]: 7: Hoare triple {37#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {37#true} is VALID [2020-07-08 12:45:20,006 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2020-07-08 12:45:20,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2020-07-08 12:45:20,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2020-07-08 12:45:20,008 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {38#false} {37#true} #77#return; {38#false} is VALID [2020-07-08 12:45:20,009 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);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, 4);~i~0 := 0; {38#false} is VALID [2020-07-08 12:45:20,009 INFO L280 TraceCheckUtils]: 13: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-08 12:45:20,010 INFO L280 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-08 12:45:20,010 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} assume !(~i~0 < ~N~0); {38#false} is VALID [2020-07-08 12:45:20,010 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2020-07-08 12:45:20,011 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {38#false} is VALID [2020-07-08 12:45:20,011 INFO L263 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {38#false} is VALID [2020-07-08 12:45:20,011 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2020-07-08 12:45:20,012 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2020-07-08 12:45:20,012 INFO L280 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 12:45:20,015 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-08 12:45:20,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062024412] [2020-07-08 12:45:20,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:20,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:20,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822664127] [2020-07-08 12:45:20,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:45:20,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:20,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:20,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:20,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:20,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:20,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:20,099 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-07-08 12:45:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:20,289 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2020-07-08 12:45:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:20,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:45:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-08 12:45:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-08 12:45:20,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2020-07-08 12:45:20,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:20,471 INFO L225 Difference]: With dead ends: 58 [2020-07-08 12:45:20,471 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 12:45:20,480 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-08 12:45:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 12:45:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-08 12:45:20,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:20,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-08 12:45:20,545 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 12:45:20,545 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 12:45:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:20,550 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-08 12:45:20,550 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-08 12:45:20,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:20,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:20,551 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-08 12:45:20,552 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-08 12:45:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:20,556 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-08 12:45:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-08 12:45:20,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:20,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:20,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:20,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-08 12:45:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-08 12:45:20,562 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-08 12:45:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:20,562 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-08 12:45:20,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-08 12:45:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:45:20,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:20,564 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] [2020-07-08 12:45:20,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:20,565 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:20,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1901566133, now seen corresponding path program 1 times [2020-07-08 12:45:20,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:20,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598220540] [2020-07-08 12:45:20,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:20,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(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; {221#true} is VALID [2020-07-08 12:45:20,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-08 12:45:20,712 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-08 12:45:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:20,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-08 12:45:20,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-08 12:45:20,725 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-08 12:45:20,726 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #77#return; {226#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:20,727 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:20,727 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(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; {221#true} is VALID [2020-07-08 12:45:20,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-08 12:45:20,728 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #81#return; {221#true} is VALID [2020-07-08 12:45:20,728 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret8 := main(); {221#true} is VALID [2020-07-08 12:45:20,729 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-08 12:45:20,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:20,730 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-08 12:45:20,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-08 12:45:20,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-08 12:45:20,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-08 12:45:20,732 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #77#return; {226#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:20,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);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, 4);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:20,735 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-08 12:45:20,735 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-08 12:45:20,736 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-08 12:45:20,736 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-08 12:45:20,736 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {222#false} is VALID [2020-07-08 12:45:20,736 INFO L263 TraceCheckUtils]: 18: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem7 == ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-08 12:45:20,737 INFO L280 TraceCheckUtils]: 19: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-08 12:45:20,737 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-08 12:45:20,737 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-08 12:45:20,739 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-08 12:45:20,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598220540] [2020-07-08 12:45:20,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:20,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:20,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578612741] [2020-07-08 12:45:20,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 12:45:20,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:20,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:20,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:20,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:20,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:20,775 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2020-07-08 12:45:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:21,052 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-08 12:45:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:45:21,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 12:45:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-08 12:45:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-08 12:45:21,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-08 12:45:21,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:21,139 INFO L225 Difference]: With dead ends: 51 [2020-07-08 12:45:21,139 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 12:45:21,141 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-08 12:45:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 12:45:21,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2020-07-08 12:45:21,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:21,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2020-07-08 12:45:21,170 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2020-07-08 12:45:21,170 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2020-07-08 12:45:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:21,175 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-08 12:45:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-08 12:45:21,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:21,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:21,176 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2020-07-08 12:45:21,177 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2020-07-08 12:45:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:21,180 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-08 12:45:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-08 12:45:21,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:21,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:21,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:21,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-08 12:45:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-08 12:45:21,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2020-07-08 12:45:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:21,185 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-08 12:45:21,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 12:45:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:45:21,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:21,187 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] [2020-07-08 12:45:21,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:21,187 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash -69884793, now seen corresponding path program 1 times [2020-07-08 12:45:21,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:21,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301921890] [2020-07-08 12:45:21,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:21,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:21,330 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:21,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:45:21,398 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:45:21,398 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:21,398 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:21,398 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:45:21,398 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:21,399 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:21,399 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:21,399 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:21,399 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:21,399 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:21,400 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:21,400 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:21,400 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:21,400 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:21,401 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:21,404 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:21,405 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:21,405 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:45:21,406 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:21,412 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:21,412 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:21,414 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:21,414 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:21,414 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:45:21,414 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:45:21,414 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:21,415 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:45:21,415 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:21,415 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:21,415 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:21,415 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:21,416 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-08 12:45:21,416 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 12:45:21,416 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 12:45:21,416 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 12:45:21,417 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:21,417 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:21,417 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:21,417 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:45:21,418 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:45:21,418 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:45:21,418 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 12:45:21,418 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 12:45:21,419 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 12:45:21,419 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 12:45:21,419 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 12:45:21,419 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-08 12:45:21,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:21 BoogieIcfgContainer [2020-07-08 12:45:21,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:21,429 INFO L168 Benchmark]: Toolchain (without parser) took 2687.67 ms. Allocated memory was 144.7 MB in the beginning and 233.8 MB in the end (delta: 89.1 MB). Free memory was 101.5 MB in the beginning and 108.7 MB in the end (delta: -7.2 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:21,431 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:21,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.37 ms. Allocated memory is still 144.7 MB. Free memory was 101.1 MB in the beginning and 90.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:21,433 INFO L168 Benchmark]: Boogie Preprocessor took 135.65 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 90.1 MB in the beginning and 179.1 MB in the end (delta: -89.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:21,435 INFO L168 Benchmark]: RCFGBuilder took 434.86 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 154.7 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:21,437 INFO L168 Benchmark]: TraceAbstraction took 1798.09 ms. Allocated memory was 201.3 MB in the beginning and 233.8 MB in the end (delta: 32.5 MB). Free memory was 154.0 MB in the beginning and 108.7 MB in the end (delta: 45.4 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:21,449 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.47 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 313.37 ms. Allocated memory is still 144.7 MB. Free memory was 101.1 MB in the beginning and 90.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.65 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 90.1 MB in the beginning and 179.1 MB in the end (delta: -89.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.86 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 154.7 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1798.09 ms. Allocated memory was 201.3 MB in the beginning and 233.8 MB in the end (delta: 32.5 MB). Free memory was 154.0 MB in the beginning and 108.7 MB in the end (delta: 45.4 MB). Peak memory consumption was 77.9 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)=6, 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] int 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={3:0}] [L30] COND TRUE i