/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/s1liff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:44,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:44,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:44,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:44,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:44,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:44,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:44,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:44,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:44,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:44,998 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:44,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:45,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:45,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:45,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:45,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:45,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:45,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:45,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:45,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:45,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:45,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:45,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:45,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:45,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:45,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:45,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:45,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:45,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:45,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:45,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:45,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:45,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:45,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:45,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:45,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:45,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:45,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:45,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:45,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:45,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:45,027 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:45,042 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:45,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:45,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:45,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:45,044 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:45,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:45,045 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:45,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:45,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:45,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:45,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:45,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:45,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:45,046 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:45,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:45,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:45,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:45,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:45,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:45,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:45,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:45,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:45,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:45,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:45,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:45,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:45,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:45,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:45,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:45,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:45,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:45,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:45,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:45,347 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:45,347 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:45,348 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s1liff.c [2020-07-10 15:26:45,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687851fb7/54c65bf556b447239a5b83fe0588d32e/FLAGe0cbe2c7a [2020-07-10 15:26:45,865 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:45,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s1liff.c [2020-07-10 15:26:45,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687851fb7/54c65bf556b447239a5b83fe0588d32e/FLAGe0cbe2c7a [2020-07-10 15:26:46,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/687851fb7/54c65bf556b447239a5b83fe0588d32e [2020-07-10 15:26:46,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:46,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:46,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:46,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:46,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:46,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5162972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46, skipping insertion in model container [2020-07-10 15:26:46,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:46,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:46,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:46,586 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:46,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:46,636 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:46,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46 WrapperNode [2020-07-10 15:26:46,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:46,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:46,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:46,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:46,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... [2020-07-10 15:26:46,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:46,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:46,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:46,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:46,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:46,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:46,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:46,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:46,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:47,358 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:47,359 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:47,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:47 BoogieIcfgContainer [2020-07-10 15:26:47,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:47,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:47,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:47,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:47,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:46" (1/3) ... [2020-07-10 15:26:47,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b296663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:47, skipping insertion in model container [2020-07-10 15:26:47,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:46" (2/3) ... [2020-07-10 15:26:47,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b296663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:47, skipping insertion in model container [2020-07-10 15:26:47,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:47" (3/3) ... [2020-07-10 15:26:47,381 INFO L109 eAbstractionObserver]: Analyzing ICFG s1liff.c [2020-07-10 15:26:47,402 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:47,411 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:47,431 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:47,461 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:47,462 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:47,462 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:47,462 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:47,462 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:47,463 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:47,463 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:47,463 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-10 15:26:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:47,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:47,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:47,500 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash -88121349, now seen corresponding path program 1 times [2020-07-10 15:26:47,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:47,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646605492] [2020-07-10 15:26:47,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:47,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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; {38#true} is VALID [2020-07-10 15:26:47,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:26:47,833 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-10 15:26:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:47,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-10 15:26:47,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-10 15:26:47,852 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-10 15:26:47,852 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-10 15:26:47,854 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:47,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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; {38#true} is VALID [2020-07-10 15:26:47,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:26:47,856 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-10 15:26:47,856 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret11 := main(); {38#true} is VALID [2020-07-10 15:26:47,856 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-10 15:26:47,857 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-10 15:26:47,858 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-10 15:26:47,858 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-10 15:26:47,859 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-10 15:26:47,859 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-10 15:26:47,860 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-10 15:26:47,860 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#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(~N~0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {39#false} is VALID [2020-07-10 15:26:47,861 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:26:47,861 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-10 15:26:47,862 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:26:47,862 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-10 15:26:47,863 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:26:47,863 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {39#false} is VALID [2020-07-10 15:26:47,863 INFO L263 TraceCheckUtils]: 19: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {39#false} is VALID [2020-07-10 15:26:47,864 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-10 15:26:47,864 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-10 15:26:47,865 INFO L280 TraceCheckUtils]: 22: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-10 15:26:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:47,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646605492] [2020-07-10 15:26:47,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:47,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:47,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929113168] [2020-07-10 15:26:47,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:47,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:47,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:47,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:47,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:47,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:47,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:47,949 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-10 15:26:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:48,247 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-10 15:26:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:48,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:26:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:26:48,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-10 15:26:48,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:48,501 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:26:48,504 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:26:48,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:26:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 15:26:48,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:48,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:48,587 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:48,587 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:48,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:48,593 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:26:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:26:48,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:48,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:48,594 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:48,594 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:26:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:48,599 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:26:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:26:48,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:48,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:48,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:48,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:26:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-10 15:26:48,605 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2020-07-10 15:26:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:48,606 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-10 15:26:48,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:26:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:48,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:48,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:48,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:48,608 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1099238599, now seen corresponding path program 1 times [2020-07-10 15:26:48,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:48,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967841914] [2020-07-10 15:26:48,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:48,776 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-10 15:26:48,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:48,777 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-10 15:26:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:48,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:26:48,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:26:48,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:48,789 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:48,791 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-10 15:26:48,791 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-10 15:26:48,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:48,792 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-10 15:26:48,792 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret11 := main(); {221#true} is VALID [2020-07-10 15:26:48,793 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-10 15:26:48,795 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:48,795 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-10 15:26:48,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:26:48,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:26:48,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:26:48,797 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:48,799 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 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(~N~0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:48,801 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-10 15:26:48,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:26:48,802 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:48,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:26:48,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:26:48,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {222#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {222#false} is VALID [2020-07-10 15:26:48,803 INFO L263 TraceCheckUtils]: 19: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-10 15:26:48,804 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-10 15:26:48,804 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-10 15:26:48,804 INFO L280 TraceCheckUtils]: 22: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-10 15:26:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:48,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967841914] [2020-07-10 15:26:48,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:48,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:48,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070676731] [2020-07-10 15:26:48,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:48,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:48,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:48,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:48,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:48,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:48,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:48,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:48,839 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-07-10 15:26:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,141 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-10 15:26:49,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:49,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:26:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:26:49,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-10 15:26:49,233 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-10 15:26:49,235 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:26:49,235 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:26:49,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:26:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-10 15:26:49,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:49,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-10 15:26:49,263 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-10 15:26:49,264 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-10 15:26:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,267 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:26:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:49,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:49,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:49,269 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-10 15:26:49,269 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-10 15:26:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:49,272 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:26:49,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:49,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:49,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:49,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:49,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:26:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-10 15:26:49,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2020-07-10 15:26:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:49,277 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-10 15:26:49,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:26:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:26:49,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:49,279 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] [2020-07-10 15:26:49,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:49,279 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:49,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash 188437731, now seen corresponding path program 1 times [2020-07-10 15:26:49,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:49,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011888532] [2020-07-10 15:26:49,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:49,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:49,458 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:49,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:49,525 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:49,526 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:49,526 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:49,526 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:49,527 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:49,528 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:49,528 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:49,528 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:49,528 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:49,528 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:49,529 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:49,529 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:49,530 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:49,534 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:49,534 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:49,534 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:49,535 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:49,540 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:49,541 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:49,541 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:49,541 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:49,542 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:49,543 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:49,544 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:49,545 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:49,545 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:49,545 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:49,545 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:49,545 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:49,545 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:49,546 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:49,546 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:49,546 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:26:49,546 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:49,546 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:49,547 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:49,548 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:49,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:49 BoogieIcfgContainer [2020-07-10 15:26:49,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:49,557 INFO L168 Benchmark]: Toolchain (without parser) took 3240.57 ms. Allocated memory was 136.3 MB in the beginning and 229.1 MB in the end (delta: 92.8 MB). Free memory was 100.7 MB in the beginning and 105.1 MB in the end (delta: -4.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:49,560 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:49,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.73 ms. Allocated memory is still 136.3 MB. Free memory was 100.5 MB in the beginning and 89.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:49,562 INFO L168 Benchmark]: Boogie Preprocessor took 149.30 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.3 MB in the beginning and 177.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:49,564 INFO L168 Benchmark]: RCFGBuilder took 577.04 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 150.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:49,566 INFO L168 Benchmark]: TraceAbstraction took 2186.28 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 150.2 MB in the beginning and 105.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:49,579 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.28 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.73 ms. Allocated memory is still 136.3 MB. Free memory was 100.5 MB in the beginning and 89.3 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.30 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.3 MB in the beginning and 177.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 577.04 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 150.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2186.28 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 150.2 MB in the beginning and 105.1 MB in the end (delta: 45.2 MB). Peak memory consumption was 74.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] = N [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L30] COND TRUE i