./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res2f.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/res2f.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b1023f44299943d749103b5e924daf7388b501f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:54:16,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:54:16,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:54:16,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:54:16,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:54:16,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:54:16,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:54:16,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:54:16,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:54:16,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:54:16,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:54:16,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:54:16,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:54:16,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:54:16,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:54:16,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:54:16,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:54:16,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:54:16,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:54:16,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:54:16,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:54:16,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:54:16,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:54:16,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:54:16,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:54:16,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:54:16,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:54:16,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:54:16,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:54:16,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:54:16,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:54:16,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:54:16,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:54:16,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:54:16,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:54:16,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:54:16,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:54:16,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:54:16,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:54:16,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:54:16,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:54:16,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:54:16,843 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:54:16,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:54:16,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:54:16,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:54:16,846 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:54:16,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:54:16,846 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:54:16,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:54:16,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:54:16,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:54:16,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:54:16,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:54:16,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:54:16,848 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:54:16,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:54:16,849 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:54:16,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:54:16,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:54:16,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:54:16,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:54:16,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:54:16,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:54:16,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:54:16,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:54:16,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:54:16,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:54:16,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:54:16,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:54:16,853 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:54:16,853 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b1023f44299943d749103b5e924daf7388b501f [2020-07-28 14:54:17,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:54:17,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:54:17,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:54:17,206 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:54:17,209 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:54:17,210 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2f.c [2020-07-28 14:54:17,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b561725a/0370a1d141a94c38906c35a46f2ed70f/FLAGebe38904e [2020-07-28 14:54:17,810 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:54:17,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2f.c [2020-07-28 14:54:17,818 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b561725a/0370a1d141a94c38906c35a46f2ed70f/FLAGebe38904e [2020-07-28 14:54:18,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b561725a/0370a1d141a94c38906c35a46f2ed70f [2020-07-28 14:54:18,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:54:18,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:54:18,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:54:18,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:54:18,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:54:18,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52eaf574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18, skipping insertion in model container [2020-07-28 14:54:18,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:54:18,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:54:18,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:54:18,485 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:54:18,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:54:18,536 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:54:18,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18 WrapperNode [2020-07-28 14:54:18,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:54:18,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:54:18,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:54:18,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:54:18,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:54:18,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:54:18,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:54:18,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:54:18,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (1/1) ... [2020-07-28 14:54:18,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:54:18,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:54:18,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:54:18,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:54:18,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (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-28 14:54:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:54:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:54:18,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 14:54:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:54:18,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:54:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:54:18,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:54:19,236 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:54:19,237 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 14:54:19,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:54:19 BoogieIcfgContainer [2020-07-28 14:54:19,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:54:19,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:54:19,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:54:19,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:54:19,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:54:18" (1/3) ... [2020-07-28 14:54:19,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d1c9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:54:19, skipping insertion in model container [2020-07-28 14:54:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:54:18" (2/3) ... [2020-07-28 14:54:19,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d1c9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:54:19, skipping insertion in model container [2020-07-28 14:54:19,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:54:19" (3/3) ... [2020-07-28 14:54:19,252 INFO L109 eAbstractionObserver]: Analyzing ICFG res2f.c [2020-07-28 14:54:19,265 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:54:19,273 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:54:19,289 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:54:19,316 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:54:19,316 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:54:19,316 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:54:19,316 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:54:19,317 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:54:19,317 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:54:19,317 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:54:19,317 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:54:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-28 14:54:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:54:19,340 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:19,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:19,342 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1780399656, now seen corresponding path program 1 times [2020-07-28 14:54:19,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:19,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830531225] [2020-07-28 14:54:19,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:19,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {33#true} is VALID [2020-07-28 14:54:19,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~post4, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~post8, main_#t~mem10, main_#t~mem11, main_#t~post9, main_#t~post12, main_#t~mem14, main_#t~mem15, main_#t~post13, main_#t~mem16, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset, main_~c~0.base, main_~c~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {33#true} is VALID [2020-07-28 14:54:19,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {33#true} is VALID [2020-07-28 14:54:19,515 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0 == assume_abort_if_not_~cond;assume false; {34#false} is VALID [2020-07-28 14:54:19,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#false} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {34#false} is VALID [2020-07-28 14:54:19,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#false} assume !(main_~i~0 < ~N~0); {34#false} is VALID [2020-07-28 14:54:19,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} main_~i~0 := 0; {34#false} is VALID [2020-07-28 14:54:19,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume !(main_~i~0 < ~N~0); {34#false} is VALID [2020-07-28 14:54:19,517 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_~i~0 := 0; {34#false} is VALID [2020-07-28 14:54:19,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {34#false} assume !(main_~i~0 < ~N~0); {34#false} is VALID [2020-07-28 14:54:19,518 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} main_~i~0 := 0; {34#false} is VALID [2020-07-28 14:54:19,518 INFO L280 TraceCheckUtils]: 11: Hoare triple {34#false} assume !true; {34#false} is VALID [2020-07-28 14:54:19,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {34#false} main_~i~0 := 0; {34#false} is VALID [2020-07-28 14:54:19,519 INFO L280 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2020-07-28 14:54:19,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} main_~i~0 := 0; {34#false} is VALID [2020-07-28 14:54:19,520 INFO L280 TraceCheckUtils]: 15: Hoare triple {34#false} assume !true; {34#false} is VALID [2020-07-28 14:54:19,521 INFO L280 TraceCheckUtils]: 16: Hoare triple {34#false} call main_#t~mem16 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {34#false} is VALID [2020-07-28 14:54:19,521 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume 0 == __VERIFIER_assert_~cond; {34#false} is VALID [2020-07-28 14:54:19,522 INFO L280 TraceCheckUtils]: 18: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 14:54:19,525 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-28 14:54:19,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830531225] [2020-07-28 14:54:19,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:54:19,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:54:19,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004339826] [2020-07-28 14:54:19,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-28 14:54:19,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:19,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:54:19,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:19,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:54:19,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:54:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:54:19,612 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-28 14:54:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:19,759 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2020-07-28 14:54:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:54:19,759 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2020-07-28 14:54:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:54:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2020-07-28 14:54:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:54:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2020-07-28 14:54:19,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 82 transitions. [2020-07-28 14:54:19,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:20,000 INFO L225 Difference]: With dead ends: 56 [2020-07-28 14:54:20,001 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 14:54:20,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:54:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 14:54:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 14:54:20,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:20,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 14:54:20,064 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 14:54:20,064 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 14:54:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:20,071 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2020-07-28 14:54:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 14:54:20,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:20,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:20,074 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 14:54:20,074 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 14:54:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:20,081 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2020-07-28 14:54:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 14:54:20,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:20,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:20,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:20,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 14:54:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-28 14:54:20,089 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2020-07-28 14:54:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:20,090 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-28 14:54:20,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:54:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 14:54:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 14:54:20,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:20,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:54:20,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:54:20,095 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1279549768, now seen corresponding path program 1 times [2020-07-28 14:54:20,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:20,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057571003] [2020-07-28 14:54:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:54:20,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {191#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {191#true} is VALID [2020-07-28 14:54:20,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {191#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~post4, main_#t~mem6, main_#t~mem7, main_#t~post5, main_#t~post8, main_#t~mem10, main_#t~mem11, main_#t~post9, main_#t~post12, main_#t~mem14, main_#t~mem15, main_#t~post13, main_#t~mem16, main_~i~0, main_~#sum~0.base, main_~#sum~0.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset, main_~c~0.base, main_~c~0.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;~N~0 := main_#t~nondet0;havoc main_#t~nondet0; {191#true} is VALID [2020-07-28 14:54:20,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {191#true} assume !(~N~0 <= 0);assume_abort_if_not_#in~cond := (if ~N~0 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {193#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:20,246 INFO L280 TraceCheckUtils]: 3: Hoare triple {193#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond); {193#(<= 1 ~N~0)} is VALID [2020-07-28 14:54:20,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#(<= 1 ~N~0)} havoc main_~i~0;call main_~#sum~0.base, main_~#sum~0.offset := #Ultimate.allocOnStack(8);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~b~0.base, main_~b~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(1, main_~#sum~0.base, main_~#sum~0.offset, 8);main_~i~0 := 0; {194#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-28 14:54:20,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {194#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ~N~0))} assume !(main_~i~0 < ~N~0); {192#false} is VALID [2020-07-28 14:54:20,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {192#false} main_~i~0 := 0; {192#false} is VALID [2020-07-28 14:54:20,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#false} assume !(main_~i~0 < ~N~0); {192#false} is VALID [2020-07-28 14:54:20,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#false} main_~i~0 := 0; {192#false} is VALID [2020-07-28 14:54:20,252 INFO L280 TraceCheckUtils]: 9: Hoare triple {192#false} assume !(main_~i~0 < ~N~0); {192#false} is VALID [2020-07-28 14:54:20,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {192#false} main_~i~0 := 0; {192#false} is VALID [2020-07-28 14:54:20,253 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#false} assume !(main_~i~0 < ~N~0); {192#false} is VALID [2020-07-28 14:54:20,253 INFO L280 TraceCheckUtils]: 12: Hoare triple {192#false} main_~i~0 := 0; {192#false} is VALID [2020-07-28 14:54:20,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {192#false} assume !(main_~i~0 < ~N~0); {192#false} is VALID [2020-07-28 14:54:20,254 INFO L280 TraceCheckUtils]: 14: Hoare triple {192#false} main_~i~0 := 0; {192#false} is VALID [2020-07-28 14:54:20,255 INFO L280 TraceCheckUtils]: 15: Hoare triple {192#false} assume !(main_~i~0 < ~N~0); {192#false} is VALID [2020-07-28 14:54:20,255 INFO L280 TraceCheckUtils]: 16: Hoare triple {192#false} call main_#t~mem16 := read~int(main_~#sum~0.base, main_~#sum~0.offset, 8);__VERIFIER_assert_#in~cond := (if main_#t~mem16 <= 3 * ~N~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {192#false} is VALID [2020-07-28 14:54:20,255 INFO L280 TraceCheckUtils]: 17: Hoare triple {192#false} assume 0 == __VERIFIER_assert_~cond; {192#false} is VALID [2020-07-28 14:54:20,256 INFO L280 TraceCheckUtils]: 18: Hoare triple {192#false} assume !false; {192#false} is VALID [2020-07-28 14:54:20,258 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-28 14:54:20,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057571003] [2020-07-28 14:54:20,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:54:20,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:54:20,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256147359] [2020-07-28 14:54:20,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-28 14:54:20,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:54:20,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:54:20,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:20,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:54:20,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:54:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:54:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:54:20,307 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2020-07-28 14:54:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:20,561 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2020-07-28 14:54:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:54:20,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-28 14:54:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:54:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:54:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2020-07-28 14:54:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:54:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2020-07-28 14:54:20,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2020-07-28 14:54:20,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:54:20,682 INFO L225 Difference]: With dead ends: 57 [2020-07-28 14:54:20,682 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 14:54:20,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:54:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 14:54:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-28 14:54:20,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:54:20,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2020-07-28 14:54:20,707 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2020-07-28 14:54:20,707 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2020-07-28 14:54:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:20,711 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-28 14:54:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-28 14:54:20,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:20,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:20,712 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2020-07-28 14:54:20,713 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2020-07-28 14:54:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:54:20,716 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-28 14:54:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-28 14:54:20,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:54:20,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:54:20,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:54:20,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:54:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 14:54:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-07-28 14:54:20,720 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2020-07-28 14:54:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:54:20,721 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-07-28 14:54:20,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:54:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-28 14:54:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-28 14:54:20,723 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:54:20,723 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-28 14:54:20,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:54:20,723 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:54:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:54:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1740145276, now seen corresponding path program 1 times [2020-07-28 14:54:20,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:54:20,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244510669] [2020-07-28 14:54:20,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:54:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:54:20,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:54:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:54:21,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:54:21,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:54:21,075 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:54:21,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 14:54:21,190 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:54:21,191 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:54:21,191 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:54:21,191 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 14:54:21,191 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-28 14:54:21,192 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:54:21,192 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 14:54:21,192 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:54:21,192 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-28 14:54:21,192 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 14:54:21,193 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 14:54:21,193 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 14:54:21,193 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-28 14:54:21,193 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 14:54:21,193 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-28 14:54:21,194 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-28 14:54:21,194 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-28 14:54:21,194 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-28 14:54:21,194 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-28 14:54:21,195 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:54:21,195 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:54:21,195 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-28 14:54:21,195 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-28 14:54:21,195 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-28 14:54:21,196 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-28 14:54:21,196 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-28 14:54:21,196 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-28 14:54:21,196 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-28 14:54:21,197 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 14:54:21,197 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 14:54:21,197 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 14:54:21,197 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 14:54:21,197 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-28 14:54:21,198 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-28 14:54:21,198 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-28 14:54:21,198 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-28 14:54:21,198 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-28 14:54:21,198 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-28 14:54:21,199 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-28 14:54:21,199 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:54:21,199 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-28 14:54:21,199 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:54:21,200 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 14:54:21,200 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 14:54:21,200 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-28 14:54:21,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:54:21 BoogieIcfgContainer [2020-07-28 14:54:21,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:54:21,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:54:21,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:54:21,204 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:54:21,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:54:19" (3/4) ... [2020-07-28 14:54:21,207 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:54:21,281 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:54:21,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:54:21,285 INFO L168 Benchmark]: Toolchain (without parser) took 3096.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 954.9 MB in the beginning and 899.0 MB in the end (delta: 55.8 MB). Peak memory consumption was 135.0 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:21,285 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:54:21,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.49 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:21,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:21,288 INFO L168 Benchmark]: Boogie Preprocessor took 38.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:54:21,288 INFO L168 Benchmark]: RCFGBuilder took 532.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:21,289 INFO L168 Benchmark]: TraceAbstraction took 1960.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 906.0 MB in the end (delta: 127.3 MB). Peak memory consumption was 127.3 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:21,290 INFO L168 Benchmark]: Witness Printer took 78.48 ms. Allocated memory is still 1.1 GB. Free memory was 906.0 MB in the beginning and 899.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-28 14:54:21,295 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.89 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.49 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -123.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 532.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1960.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 906.0 MB in the end (delta: 127.3 MB). Peak memory consumption was 127.3 MB. Max. memory is 11.5 GB. * Witness Printer took 78.48 ms. Allocated memory is still 1.1 GB. Free memory was 906.0 MB in the beginning and 899.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 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 [N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L11] COND FALSE !(!cond) VAL [N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L28] int *b = malloc(sizeof(int)*N); [L29] int *c = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [N=1] [L32] COND TRUE i