/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/s52iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:58,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:58,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:58,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:58,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:58,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:58,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:58,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:58,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:58,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:58,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:58,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:58,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:58,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:58,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:58,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:58,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:58,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:58,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:58,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:58,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:58,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:58,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:58,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:58,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:58,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:58,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:58,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:58,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:58,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:58,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:58,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:58,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:58,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:58,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:58,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:58,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:58,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:58,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:58,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:58,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:58,877 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:58,894 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:58,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:58,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:58,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:58,897 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:58,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:58,897 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:58,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:58,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:58,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:58,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:58,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:58,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:58,902 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:58,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:58,903 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:58,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:58,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:58,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:58,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:58,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:58,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:58,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:58,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:58,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:58,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:58,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:58,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:58,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:58,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:59,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:59,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:59,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:59,226 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:59,227 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:59,228 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s52iff.c [2020-07-10 15:26:59,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7c94aa2/5f7d70559c15430da9684097339a59b3/FLAG8cfae8c8e [2020-07-10 15:26:59,840 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:59,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s52iff.c [2020-07-10 15:26:59,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7c94aa2/5f7d70559c15430da9684097339a59b3/FLAG8cfae8c8e [2020-07-10 15:27:00,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7c94aa2/5f7d70559c15430da9684097339a59b3 [2020-07-10 15:27:00,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:00,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:00,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:00,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:00,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:00,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be77a37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00, skipping insertion in model container [2020-07-10 15:27:00,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:00,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:00,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:00,464 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:00,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:00,509 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:00,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00 WrapperNode [2020-07-10 15:27:00,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:00,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:00,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:00,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:00,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (1/1) ... [2020-07-10 15:27:00,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:00,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:00,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:00,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:00,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (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:27:00,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:00,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:00,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:00,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:00,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:00,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:00,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:00,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:00,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:00,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:00,732 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:27:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:27:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:00,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:00,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:01,249 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:01,249 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:27:01,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:01 BoogieIcfgContainer [2020-07-10 15:27:01,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:01,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:01,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:01,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:01,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:00" (1/3) ... [2020-07-10 15:27:01,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb62750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:01, skipping insertion in model container [2020-07-10 15:27:01,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:00" (2/3) ... [2020-07-10 15:27:01,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb62750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:01, skipping insertion in model container [2020-07-10 15:27:01,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:01" (3/3) ... [2020-07-10 15:27:01,268 INFO L109 eAbstractionObserver]: Analyzing ICFG s52iff.c [2020-07-10 15:27:01,281 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:01,291 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:01,308 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:01,339 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:01,339 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:01,339 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:01,340 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:01,340 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:01,340 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:01,340 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:01,340 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:27:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:27:01,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:01,364 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:27:01,365 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash 2033030480, now seen corresponding path program 1 times [2020-07-10 15:27:01,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:01,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708335801] [2020-07-10 15:27:01,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:01,599 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:27:01,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:27:01,600 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:27:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:01,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:27:01,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:27:01,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:27:01,613 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:27:01,615 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:27:01,616 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:27:01,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:27:01,616 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:27:01,617 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2020-07-10 15:27:01,617 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:27:01,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-10 15:27:01,618 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:27:01,618 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:27:01,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:27:01,620 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:27:01,620 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:27:01,621 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:27:01,621 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:27:01,621 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:27:01,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:27:01,623 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:27:01,624 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:27:01,624 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:27:01,624 INFO L263 TraceCheckUtils]: 19: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem13 == 6 * ~N~0 then 1 else 0)); {40#false} is VALID [2020-07-10 15:27:01,625 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-10 15:27:01,625 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-10 15:27:01,626 INFO L280 TraceCheckUtils]: 22: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:27:01,630 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:27:01,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708335801] [2020-07-10 15:27:01,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:01,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:01,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996570495] [2020-07-10 15:27:01,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:27:01,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:01,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:01,702 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:27:01,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:01,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:01,718 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-10 15:27:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:01,974 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-10 15:27:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:01,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:27:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:27:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:27:01,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-10 15:27:02,149 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:27:02,162 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:27:02,163 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:27:02,167 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:27:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:27:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:27:02,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:02,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:02,225 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:02,226 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:02,230 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:27:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:27:02,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:02,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:02,232 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:02,232 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:27:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:02,237 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:27:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:27:02,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:02,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:02,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:02,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:27:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:27:02,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2020-07-10 15:27:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:02,244 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:27:02,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:02,244 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:27:02,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:27:02,245 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:02,246 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:27:02,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:02,246 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash 706992569, now seen corresponding path program 1 times [2020-07-10 15:27:02,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:02,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408639274] [2020-07-10 15:27:02,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:02,368 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:27:02,368 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:27:02,369 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:27:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:02,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:27:02,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:27:02,379 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:27:02,381 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:02,382 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:27:02,382 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:27:02,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:27:02,383 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:27:02,383 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret14 := main(); {227#true} is VALID [2020-07-10 15:27:02,384 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:27:02,385 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:02,385 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:27:02,385 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:27:02,386 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:27:02,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:27:02,387 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:02,389 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:27:02,390 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:27:02,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:27:02,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:27:02,391 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:27:02,392 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:27:02,392 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:27:02,392 INFO L263 TraceCheckUtils]: 19: Hoare triple {228#false} call __VERIFIER_assert((if #t~mem13 == 6 * ~N~0 then 1 else 0)); {228#false} is VALID [2020-07-10 15:27:02,393 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-10 15:27:02,393 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-10 15:27:02,393 INFO L280 TraceCheckUtils]: 22: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-10 15:27:02,394 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:27:02,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408639274] [2020-07-10 15:27:02,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:02,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:02,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253741325] [2020-07-10 15:27:02,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:27:02,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:02,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:02,429 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:27:02,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:02,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:02,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:02,431 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2020-07-10 15:27:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:02,748 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-07-10 15:27:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:02,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:27:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:27:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:27:02,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-10 15:27:02,864 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:27:02,867 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:27:02,867 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:27:02,869 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:27:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:27:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-07-10 15:27:02,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:02,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2020-07-10 15:27:02,915 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2020-07-10 15:27:02,915 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2020-07-10 15:27:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:02,920 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:27:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:27:02,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:02,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:02,922 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2020-07-10 15:27:02,923 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2020-07-10 15:27:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:02,933 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:27:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:27:02,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:02,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:02,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:02,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:27:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:27:02,939 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2020-07-10 15:27:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:02,940 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:27:02,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:02,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:27:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:27:02,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:02,945 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:27:02,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:02,945 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash 284203188, now seen corresponding path program 1 times [2020-07-10 15:27:02,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:02,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133524279] [2020-07-10 15:27:02,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:03,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:03,117 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:03,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:03,181 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:03,181 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:03,182 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:03,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:03,183 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:03,183 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:03,183 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:03,183 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:03,184 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:03,184 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:03,184 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:03,184 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:03,184 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:03,184 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:03,185 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:03,185 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:03,185 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:03,185 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:03,185 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:03,185 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:03,186 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:03,186 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:03,186 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:03,186 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:03,186 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 15:27:03,186 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:27:03,187 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:03,187 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:03,187 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:03,187 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:03,187 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:03,187 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:03,188 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:03,188 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:03,188 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:03,188 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:03,188 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:27:03,188 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:27:03,189 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:27:03,189 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:27:03,189 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:27:03,189 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:27:03,189 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:27:03,189 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:27:03,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:03 BoogieIcfgContainer [2020-07-10 15:27:03,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:03,196 INFO L168 Benchmark]: Toolchain (without parser) took 3005.09 ms. Allocated memory was 135.8 MB in the beginning and 228.1 MB in the end (delta: 92.3 MB). Free memory was 100.9 MB in the beginning and 98.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 94.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,198 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.16 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 89.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,200 INFO L168 Benchmark]: Boogie Preprocessor took 156.31 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.2 MB in the beginning and 177.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,200 INFO L168 Benchmark]: RCFGBuilder took 588.38 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 150.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,201 INFO L168 Benchmark]: TraceAbstraction took 1935.20 ms. Allocated memory was 200.3 MB in the beginning and 228.1 MB in the end (delta: 27.8 MB). Free memory was 149.7 MB in the beginning and 98.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,205 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.16 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 89.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 156.31 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 89.2 MB in the beginning and 177.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 588.38 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 150.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1935.20 ms. Allocated memory was 200.3 MB in the beginning and 228.1 MB in the end (delta: 27.8 MB). Free memory was 149.7 MB in the beginning and 98.5 MB in the end (delta: 51.2 MB). Peak memory consumption was 79.0 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